The following pages link to (Q4850545):
Displayed 19 items.
- Proof complexity of propositional default logic (Q647339) (← links)
- The deduction theorem for strong propositional proof systems (Q987382) (← links)
- Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II (Q1575637) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- Weak theories of linear algebra (Q1766923) (← links)
- The proof complexity of linear algebra (Q1886325) (← links)
- A bounded arithmetic AID for Frege systems (Q1977488) (← links)
- Quasipolynomial size proofs of the propositional pigeonhole principle (Q2344736) (← links)
- Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets (Q2378659) (← links)
- Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (Q3012837) (← links)
- Propositional Proofs in Frege and Extended Frege Systems (Abstract) (Q3194704) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Short Proofs for the Determinant Identities (Q5252690) (← links)
- The Deduction Theorem for Strong Propositional Proof Systems (Q5458838) (← links)
- Proof Complexity of Non-classical Logics (Q5894972) (← links)
- Propositional proof complexity (Q6064569) (← links)