Complexity of admissible rules

DOI10.1007/S00153-006-0028-9zbMATH Open1115.03010OpenAlexW2111570288WikidataQ56474452 ScholiaQ56474452MaRDI QIDQ868660FDOQ868660

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

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

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)

Cites Work

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

Cited In (24)

• Unification in linear temporal logic LTL
• Inference rules in Nelson's logics, admissibility and weak admissibility
• 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 and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• Tutorial on Admissible Rules in Gudauri
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Admissible rules in the implication-negation fragment of intuitionistic logic
• Rules with parameters in modal logic. II.
• Proof theory for admissible rules
• Title not available (Why is that?)
• Proof complexity of non-classical logics
• A Tableau Method for Checking Rule Admissibility in S4
• Rules with parameters in modal logic. I.
• PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS
• What is an inference rule?
• Universal proof theory: feasible admissibility in intuitionistic modal logics
• UNIFICATION IN INTERMEDIATE LOGICS
• Admissible Rules of Lukasiewicz Logic
• Canonical rules
• KD is nullary
• Logic of Visibility, Perception, and Knowledge and Admissible Inference 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)