The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC

DOI10.1007/BF02259929zbMath0795.03017MaRDI QIDQ1317616

S. V. Babenyshev

Publication date: 12 April 1994

Published in: Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

algorithmsdecidabilitysuperintuitionistic logicadmissibility problemKuznetsov-Friedman problemmodal companionWeak Law of Excluded Middle

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55)

Related Items

A Tableau Method for Checking Rule Admissibility in S4

Cites Work

• Epistemic considerations in game theory
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• Admissible rules for pretable modal logics
• A general filtration method for modal logics