Complexity of admissible rules

DOI10.1007/S00153-006-0028-9MaRDI QIDQ868660zbMATH OpenOpenAlexWikidataFDO

Authors 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

complexityadmissible rulesintermediate logicmodal logic

Mathematics Subject Classification ID

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

Recommendations

• The complexity of admissible rules of Łukasiewicz logic
• scientific article; zbMATH DE number 3959387
• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• Admissibility of logical inference rules
• Proof theory for admissible rules

Cites work

• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 3474957 (Why is no real title available?)
• scientific article; zbMATH DE number 3532920 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 3995647 (Why is no real title available?)
• scientific article; zbMATH DE number 757645 (Why is no real title available?)
• A Resolution/Tableaux Algorithm for Projective Approximations in IPC
• Admissibility of logical inference rules
• Admissible Rules of Modal Logics
• Best solving modal equations
• Canonical formulas for K4. Part II: Cofinal subframe logics
• Decidable modal logic with undecidable admissibility problem
• Intermediate logics and Visser's rules
• Intuitionistic propositional logic is polynomial-space complete
• Modal logic
• On the admissible rules of intuitionistic propositional logic
• On the rules of intermediate logics
• One hundred and two problems in mathematical logic
• That All Normal Extensions of S4.3 Have the Finite Model Property
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Unification in intuitionistic logic

Cited in

(26)

• A tableau method for checking rule admissibility in S4
• What is an inference rule?
• Computability issues for adaptive logics in multi-consequence standard format
• A syntactic approach to unification in transitive reflexive modal logics
• scientific article; zbMATH DE number 1746563 (Why is no real title available?)
• Rules with parameters in modal logic. II.
• Universal proof theory: feasible admissibility in intuitionistic modal logics
• About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
• KD is nullary
• UNIFICATION IN INTERMEDIATE LOGICS
• Inference rules in Nelson's logics, admissibility and weak admissibility
• Canonical rules
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Tutorial on admissible rules in Gudauri
• Preservation of admissible rules when combining logics
• Logic of Visibility, Perception, and Knowledge and Admissible Inference Rules
• Proof complexity of non-classical logics
• Admissible rules in the implication-negation fragment of intuitionistic logic
• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• Admissible Rules of Lukasiewicz Logic
• The complexity of admissible rules of Łukasiewicz logic
• On rules
• Unification in linear temporal logic LTL
• Rules with parameters in modal logic. I.
• Proof theory for admissible rules

This page was built for publication: Complexity of admissible rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868660)