scientific article; zbMATH DE number 806751
From MaRDI portal
Publication:4850552
zbMATH Open0843.03033MaRDI QIDQ4850552FDOQ4850552
Authors: Jan Krajíček
Publication date: 15 August 1996
Title of this publication is not available (Why is that?)
Recommendations
forcingnonstandard modelsproof lengthextensions of modelsFrege systemBoolean valuationsecond-order arithmetics
Classical propositional logic (03B05) Complexity of proofs (03F20) Second- and higher-order arithmetic and fragments (03F35)
Cited In (15)
- Proof internalization in generalized Frege systems for classical logic
- Frege systems for extensible modal logics
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Frege proof system and TNC°
- Extension without cut
- The Complexity of Propositional Proofs
- Partially definable forcing and bounded arithmetic
- Hard examples for the bounded depth Frege proof system
- Title not available (Why is that?)
- Title not available (Why is that?)
- The provably total NP search problems of weak second order bounded arithmetic
- Cutting planes, connectivity, and threshold logic
- Strong extension-free proof systems
- Substitution Frege and extended Frege proof systems in non-classical logics
- A bounded arithmetic AID for Frege systems
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)