FMP-ensuring logics, RA-ensuring logics and FA-ensuring logics in NExtK4.3

DOI10.1007/s11225-023-10046-5OpenAlexW4381168064MaRDI QIDQ6067743

No author found.

Publication date: 17 November 2023

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-023-10046-5

zbMATH Keywords

modal logicfinite model propertyfinite axiomatizabilityrecursive axiomatizabilityFA-ensuringFMP-ensuringRA-ensuring

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tools and techniques in modal logic
• Transitive logics of finite width with respect to proper-successor-equivalence
• Some normal extensions of K4.3
• Undecidable theories
• Logics containing K4. Part II
• Transitivity follows from Dummett's axiom
• The decidability of normal K5 logics
• Using the Universal Modality: Gains and Questions
• An ascending chain of S4 logics
• Two simple incomplete modal logics
• Prefinitely axiomatizable modal and intermediate logics
• All Finitely Axiomatizable Normal Extensions of K4.3 are Decidable
• Logics containing K4. Part I
• That All Normal Extensions of S4.3 Have the Finite Model Property
• The Logics Containing S 4.3
• Modal logics with linear alternative relations
• Extensions of the Lewis system S5

This page was built for publication: FMP-ensuring logics, RA-ensuring logics and FA-ensuring logics in NExtK4.3