On Finite Model Property for Admissible Rules

DOI10.1002/MALQ.19990450409zbMATH Open0938.03033OpenAlexW1975190772MaRDI QIDQ4704656FDOQ4704656

Authors V. R. Kiyatkin, Tahsin Öner, Vladimir Rybakov

Publication date 14 June 2000

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19990450409

zbMATH Keywords

admissible rulesmodal logicfinite model property

Mathematics Subject Classification ID

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

Recommendations

• Finite frames fail: how infinity works its way into the semantics of admissibility
• The finite model property with respect to admissibility for superintuitionistic logic
• scientific article; zbMATH DE number 1396691
• scientific article; zbMATH DE number 1499106

Cites work

• scientific article; zbMATH DE number 50169 (Why is no real title available?)
• scientific article; zbMATH DE number 3485746 (Why is no real title available?)
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• A decidable noncompact extension of the logic S4
• A general filtration method for modal logics
• A modal analog for Glivenko's theorem and its applications
• A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property
• Algebraic semantics for modal logics I
• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• Logics containing K4. Part I
• Modal Logics Between S 4 and S 5
• Modal logics with LM-axioms
• Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
• Rules of inference with parameters for intuitionistic logic
• Splittings and the finite model property
• That All Normal Extensions of S4.3 Have the Finite Model Property
• The Logics Containing S 4.3
• The finite model property in tense logic

Cited in

(14)

• A tableau method for checking rule admissibility in S4
• scientific article; zbMATH DE number 1396728 (Why is no real title available?)
• scientific article; zbMATH DE number 1746563 (Why is no real title available?)
• The finite model property and recursive bounds on the size of countermodels
• Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
• Bimodal logics with a ``weakly connected component without the finite model property
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Linear temporal logic with until and next, logical consecutions
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• Logical consecutions in discrete linear temporal logic
• Finite frames fail: how infinity works its way into the semantics of admissibility
• Hereditarily structurally complete superintuitionistic deductive systems
• 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
• Rules with parameters in modal logic. I.

This page was built for publication: On Finite Model Property for Admissible Rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4704656)