Pages that link to "Item:Q3472096"
From MaRDI portal
The following pages link to Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096):
Displaying 17 items.
- Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (Q4649532) (← links)
- Substitution and Propositional Proof Complexity (Q5027247) (← links)
- On an optimal quantified propositional proof system nal proof system and a complete language for NP ∩ co-NP for NP ∩ co-NP (Q5055954) (← links)
- INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH (Q5082067) (← links)
- P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle (Q5092409) (← links)
- NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN (Q5100043) (← links)
- (Q5111195) (← links)
- Combinatorial flows and their normalisation (Q5111329) (← links)
- The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem (Q5204803) (← links)
- Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds (Q5311724) (← links)
- Implicit proofs (Q5311729) (← links)
- The Complexity of Propositional Proofs (Q5444711) (← links)
- The Deduction Theorem for Strong Propositional Proof Systems (Q5458838) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Propositional proof complexity (Q6064569) (← links)
- Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq (Q6099613) (← links)
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
