The decidability of normal K5 logics

DOI10.2307/2273624zbMath0473.03009OpenAlexW2153275758MaRDI QIDQ3927209

Michael C. Nagle

Publication date: 1981

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2273624

zbMATH Keywords

modal logicfinite model propertyfinitely axiomatisable

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (5)

Axiomatization and completeness of lexicographic products of modal logics ⋮ Definability in the class of all -frames – computability and complexity ⋮ Simplified Kripke-style semantics for some normal modal logics ⋮ FMP-ensuring logics, RA-ensuring logics and FA-ensuring logics in NExtK4.3 ⋮ Axiomatization and Completeness of Lexicographic Products of Modal Logics

Cites Work

• Unnamed Item
• That All Normal Extensions of S4.3 Have the Finite Model Property
• The Logics Containing S 4.3

This page was built for publication: The decidability of normal K5 logics