(i) Do the propositional pigeonhole-principle tautologies PHP_n^{2n} and PHP_n^{n^2} have polynomial-size, constant-depth LK proofs?
Statement
(i) Do the propositional pigeonhole-principle tautologies PHP_n^{2n} and PHP_n^{n^2} have polynomial-size, constant-depth LK proofs? (ii) Let π(x) be the number of primes at most x, and let IΔ₀(π) be IΔ₀ augmented by π and its natural recursive definition. Conjecture: IΔ₀(π) proves that there are arbitrarily large prime numbers.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.