Construction of an Explicit Basis for Rules Admissible in Modal System S4

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200111)47:4<441::AID-MALQ441>3.0.CO;2-J" /><441::AID-MALQ441>3.0.CO;2-J 10.1002/1521-3870(200111)47:4<441::AID-MALQ441>3.0.CO;2-JzbMath0992.03027OpenAlexW2080542786MaRDI QIDQ2765566

Vladimir Vladimirovich Rybakov

Publication date: 24 July 2002

Full work available at URL: https://doi.org/10.1002/1521-3870(200111)47:4<441::aid-malq441>3.0.co;2-j

zbMATH Keywords

admissible inference rulesmodal logic S4free modal algebrabasis for admissible rulesbasis for quasi-identities

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other algebras related to logic (03G25)

Related Items (18)

Admissible inference rules and semantic property of modal logics ⋮ Multiple Conclusion Rules in Logics with the Disjunction Property ⋮ Admissible bases via stable canonical rules ⋮ Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements ⋮ Unnamed Item ⋮ 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}^+\) ⋮ KD is nullary ⋮ Explicit basis for admissible rules in \(K\)-saturated tabular 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 ⋮ 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 ⋮ 2007 European Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '07 ⋮ Linear temporal logic with until and next, logical consecutions ⋮ 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

This page was built for publication: Construction of an Explicit Basis for Rules Admissible in Modal System S4