A criterion for admissibility of rules in the modal system S4 and intuitionistic logic

DOI10.1007/BF01982031zbMath0598.03013OpenAlexW2046526482MaRDI QIDQ1079558

Vladimir Vladimirovich Rybakov

Publication date: 1984

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

Full work available at URL: https://eudml.org/doc/187289

zbMATH Keywords

modal logicadmissible rulesintuitionistic propositional logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Other algebras related to logic (03G25) Metamathematics of constructive systems (03F50) Intermediate logics (03B55)

Related Items

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property ⋮ Multiple Conclusion Rules in Logics with the Disjunction Property ⋮ About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \) ⋮ Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements ⋮ Equations in free topoboolean algebra ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Admissibility and Unifiability in Contact Logics ⋮ A Note on Extensions: Admissible Rules via Semantics ⋮ Admissible and derivable rules in intuitionistic logic ⋮ A Tableau Method for Checking Rule Admissibility in S4 ⋮ Satisfiability in Boolean Logic (SAT problem) is polynomial? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hereditarily structurally complete modal logics ⋮ 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}^+\) ⋮ On unification and admissible rules in Gabbay-de Jongh logics ⋮ KD is nullary ⋮ Explicit basis for admissible rules in \(K\)-saturated tabular logics ⋮ Description of modal logics which enjoy co-cover property ⋮ Admissibility in positive logics ⋮ Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL ⋮ Admissible inference rules of modal WCP-logics ⋮ An explicit basis for \textit{WCP}-globally admissible inference rules ⋮ Best unifiers in transitive modal logics ⋮ Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus ⋮ Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms ⋮ Admissibility and refutation: some characterisations of intermediate logics ⋮ Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation ⋮ Semantic admissibility criteria for deduction rules in S4 and Int ⋮ Unification in pretabular extensions of S4 ⋮ Finite frames fail: how infinity works its way into the semantics of admissibility ⋮ Unification in linear temporal logic LTL ⋮ On the rules of intermediate logics ⋮ On Finite Model Property for Admissible Rules ⋮ Logical consecutions in discrete linear temporal logic ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility ⋮ Rules with parameters in modal logic. I. ⋮ Admissibility via natural dualities ⋮ The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC

Cites Work

• Decidability of the admissibility problem in layer-finite logics
• The deducibilities of S5
• Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
• One hundred and two problems in mathematical logic
• ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item