A simplified lower bound for implicational logic
From MaRDI portal
Cites work
- A lower bound for intuitionistic logic
- An Introduction to Proof Theory
- Boolean function complexity. Advances and frontiers.
- Constructivism in mathematics. An introduction. Volume I
- Disjunction and existence under implication in elementary intuitionistic formalisms
- Frege systems for extensible modal logics
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 4008289 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 1390276 (Why is no real title available?)
- scientific article; zbMATH DE number 2187723 (Why is no real title available?)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Lower bounds for modal logics
- On lengths of proofs in non-classical logics
- On the complexity of the disjunction property in intuitionistic and modal logics
- Proof Complexity
- Proof complexity of intuitionistic implicational formulas
- Proof complexity of substructural logics
- Proof compression and NP versus PSPACE
- Proof Compression and NP Versus PSPACE II: Addendum
- Proof compression and NP versus PSPACE. II
- Random formulas, monotone circuits, and interpolation
- Some remarks on lengths of propositional proofs
- Substitution Frege and extended Frege proof systems in non-classical logics
- The complexity of the disjunction and existential properties in intuitionistic logic
- The gap between monotone and non-monotone circuit complexity is exponential
- The monotone circuit complexity of Boolean functions
- The relative efficiency of propositional proof systems
This page was built for publication: A simplified lower bound for implicational logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6993433)
