ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QQ be a propositional proof system. A theory T\mathcal{T} 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 QQ, there is a conservative extension T\mathcal{T} of ZFC or PA that outperforms QQ in proving tautologies. Moreover, adjoining an undecidable statement as a new axiom to T\mathcal{T} to form a conservative extension T′\mathcal{T}' further improves T\mathcal{T} 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.