A normal modal calculus between T and s4 without the finite model property

Journal of Symbolic Logic 34 (1):35-38 (1969)
  Copy   BIBTEX

Abstract

The first example of an intuitively meaningful propositional logic without the finite model property, and still the simplest one in the literature. The question of its decidability appears still to be open.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Syntactic Refutations against Finite Models in Modal Logic.Tomasz Skura - 1994 - Notre Dame Journal of Formal Logic 35 (4):595-605.
An incomplete decidable modal logic.M. J. Cresswell - 1984 - Journal of Symbolic Logic 49 (2):520-527.
Decidability and the finite model property.Alasdair Urquhart - 1981 - Journal of Philosophical Logic 10 (3):367 - 370.
New Modification of the Subformula Property for a Modal Logic.Mitio Takano - 2020 - Bulletin of the Section of Logic 49 (3):255-268.
Products of modal logics, part 1.D. Gabbay & V. Shehtman - 1998 - Logic Journal of the IGPL 6 (1):73-146.

Analytics

Added to PP
2009-01-28

Downloads
13 (#288,494)

6 months
258 (#80,415)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

David Makinson
London School of Economics

References found in this work

Semantical Analysis of Modal Logic I. Normal Propositional Calculi.Saul A. Kripke - 1963 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (5‐6):67-96.
That All Normal Extensions of S4.3 Have the Finite Model Property.R. A. Bull - 1966 - Mathematical Logic Quarterly 12 (1):341-344.

Add more references