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

DOI10.1007/BF01982031zbMath0598.03013MaRDI 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 logic; admissible rules; intuitionistic propositional logic

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B60: Other nonclassical logic

03B25: Decidability of theories and sets of sentences

03G25: Other algebras related to logic

03F50: Metamathematics of constructive systems

03B55: Intermediate logics

Related Items

Admissible and derivable rules in intuitionistic logic, On Finite Model Property for Admissible Rules, European Summer Meeting of the Association for Symbolic Logic, Hereditarily structurally complete modal logics, Logical consecutions in discrete linear temporal logic, 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, Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition, Best unifiers in transitive modal logics, Unification in linear temporal logic LTL, Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements, 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, Equations in free topoboolean algebra, Semantic admissibility criteria for deduction rules in S4 and Int, The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC, Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property, On the rules of intermediate logics, Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL

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