scientific article; zbMATH DE number 806751
From MaRDI portal
Publication:4850552
Recommendations
Cited in
(15)- Partially definable forcing and bounded arithmetic
- Cutting planes, connectivity, and threshold logic
- Proof internalization in generalized Frege systems for classical logic
- Extension without cut
- Hard examples for the bounded depth Frege proof system
- Frege systems for extensible modal logics
- Substitution Frege and extended Frege proof systems in non-classical logics
- Strong extension-free proof systems
- The Complexity of Propositional Proofs
- scientific article; zbMATH DE number 806744 (Why is no real title available?)
- A bounded arithmetic AID for Frege systems
- The provably total NP search problems of weak second order bounded arithmetic
- scientific article; zbMATH DE number 2015272 (Why is no real title available?)
- Frege proof system and TNC°
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850552)