Completeness of S4 with respect to the real line: revisited

Annals of Pure and Applied Logic 131 (1-3):287-301 (2005)
  Copy   BIBTEX

Abstract

We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369).

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

Analytics

Added to PP
2017-02-19

Downloads
6 (#1,482,791)

6 months
4 (#1,006,434)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Modal Logics Between S 4 and S 5.M. A. E. Dummett & E. J. Lemmon - 1959 - Mathematical Logic Quarterly 5 (14‐24):250-264.
Modal Logics Between S 4 and S 5.M. A. E. Dummett & E. J. Lemmon - 1959 - Mathematical Logic Quarterly 5 (14-24):250-264.
« Everywhere » and « here ».Valentin Shehtman - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):369-379.
Five critical modal systems.L. Esakia & V. Meskhi - 1977 - Theoria 43 (1):52-60.

View all 10 references / Add more references