Substitution Frege and extended Frege proof systems in non-classical logics
From MaRDI portal
Publication:1023047
DOI10.1016/J.APAL.2008.10.005zbMath1173.03044OpenAlexW2155797483MaRDI QIDQ1023047
Publication date: 10 June 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.10.005
Modal logic (including the logic of norms) (03B45) Complexity of proofs (03F20) Intermediate logics (03B55)
Related Items (11)
Proof complexity of modal resolution ⋮ Expander Construction in VNC1 ⋮ Proof complexity of intuitionistic implicational formulas ⋮ Expander construction in \(\mathrm{VNC}^1\) ⋮ Proof complexity of propositional default logic ⋮ Topological differential fields and dimension functions ⋮ Rules with parameters in modal logic. II. ⋮ Proof complexity of substructural logics ⋮ Proof Complexity of Non-classical Logics ⋮ On the proof complexity of logics of bounded branching ⋮ Rules with parameters in modal logic. I.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for intuitionistic logic
- The monotone circuit complexity of Boolean functions
- The complexity of the disjunction and existential properties in intuitionistic logic
- Monotone simulations of non-monotone proofs.
- Dual weak pigeonhole principle, Boolean complexity, and derandomization
- Frege systems for extensible modal logics
- Polynomial size proofs of the propositional pigeonhole principle
- The relative efficiency of propositional proof systems
- Canonical formulas for K4. Part II: Cofinal subframe logics
- On the complexity of the disjunction property in intuitionistic and modal logics
- Lower bounds for modal logics
- Admissible Rules of Modal Logics
- On the computational content of intuitionistic propositional proofs
This page was built for publication: Substitution Frege and extended Frege proof systems in non-classical logics
