A Normal Modal Calculus Between T and S4 without the Finite Model Property

Journal of Symbolic Logic 36 (4):692-692 (1971)
  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: 94,070

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.
The finite model property in tense logic.Frank Wolter - 1995 - Journal of Symbolic Logic 60 (3):757-774.
Connected modal logics.Guram Bezhanishvili & David Gabelaia - 2011 - Archive for Mathematical Logic 50 (3-4):287-317.
An incomplete decidable modal logic.M. J. Cresswell - 1984 - Journal of Symbolic Logic 49 (2):520-527.

Analytics

Added to PP
2017-02-21

Downloads
16 (#906,830)

6 months
6 (#701,155)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

David Makinson
London School of Economics

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references