Complexity of admissible rules

DOI10.1007/s00153-006-0028-9zbMath1115.03010OpenAlexW2111570288WikidataQ56474452 ScholiaQ56474452MaRDI QIDQ868660

Emil Jeřábek

Publication date: 6 March 2007

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-006-0028-9

zbMATH Keywords

complexitymodal logicadmissible rulesintermediate logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Intermediate logics (03B55)

Related Items (18)

On rules ⋮ A syntactic approach to unification in transitive reflexive modal logics ⋮ About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \) ⋮ UNIFICATION IN INTERMEDIATE LOGICS ⋮ Tutorial on Admissible Rules in Gudauri ⋮ A Tableau Method for Checking Rule Admissibility in S4 ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ KD is nullary ⋮ Admissible rules in the implication-negation fragment of intuitionistic logic ⋮ PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS ⋮ Rules with parameters in modal logic. II. ⋮ Unification in linear temporal logic LTL ⋮ Proof Complexity of Non-classical Logics ⋮ Proof theory for admissible rules ⋮ Canonical rules ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility ⋮ Rules with parameters in modal logic. I.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intermediate logics and Visser's rules
• Intuitionistic propositional logic is polynomial-space complete
• Admissibility of logical inference rules
• Best solving modal equations
• Decidable modal logic with undecidable admissibility problem
• On the rules of intermediate logics
• On the admissible rules of intuitionistic propositional logic
• A Resolution/Tableaux Algorithm for Projective Approximations in IPC
• One hundred and two problems in mathematical logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Unification in intuitionistic logic
• Canonical formulas for K4. Part II: Cofinal subframe logics
• That All Normal Extensions of S4.3 Have the Finite Model Property
• Admissible Rules of Modal Logics

This page was built for publication: Complexity of admissible rules