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

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

zbMATH Keywords

admissible rulesmodal logicfinite model property

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

• Linear temporal logic with until and next, logical consecutions
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Title not available (Why is that?)
• A Tableau Method for Checking Rule Admissibility in S4
• Logical consecutions in discrete linear temporal logic
• Rules with parameters in modal logic. I.
• 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
• Title not available (Why is that?)
• Hereditarily structurally complete superintuitionistic deductive systems
• Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
• The finite model property and recursive bounds on the size of countermodels
• Finite frames fail: how infinity works its way into the semantics of admissibility

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)