Frege systems for extensible modal logics

DOI10.1016/j.apal.2006.04.001zbMath1101.03038OpenAlexW2101249878MaRDI QIDQ2503409

Emil Jeřábek

Publication date: 14 September 2006

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.2006.04.001

zbMATH Keywords

modal logicadmissible rulespropositional proof complexityframe semantics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of proofs (03F20)

Related Items

Proof complexity of intuitionistic implicational formulas ⋮ Proof complexity of propositional default logic ⋮ On lengths of proofs in non-classical logics ⋮ Proof Complexity of Non-classical Logics ⋮ Substitution Frege and extended Frege proof systems in non-classical logics ⋮ Canonical rules ⋮ 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
• The complexity of the disjunction and existential properties in intuitionistic logic
• Admissibility of logical inference rules
• Best solving modal equations
• On the admissible rules of intuitionistic propositional logic
• Disjunction and existence under implication in elementary intuitionistic formalisms
• Canonical formulas for K4. Part I: Basic results
• The relative efficiency of propositional proof systems
• Unification in intuitionistic logic
• On the complexity of the disjunction property in intuitionistic and modal logics
• Admissible Rules of Modal Logics
• On the computational content of intuitionistic propositional proofs