Proof-system domination by conservative extensions conjecture
Statement
Let be a propositional proof system. A theory is a conservative extension of a base theory when it extends that theory without proving any new sentences in the base theory’s original language. Conservative-extension domination conjecture. For every propositional proof system , there is a conservative extension of ZFC or PA that outperforms in proving tautologies. Moreover, adjoining an undecidable statement as a new axiom to to form a conservative extension further improves in proving tautologies. The conjecture connects the nonexistence of optimal propositional proof systems with undecidability and the effect of adding axioms, but the source provides no resolution.
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.