Euclidean hierarchy in modal logic

Studia Logica 75 (3):327-344 (2003)
  Copy   BIBTEX

Abstract

For a Euclidean space , let L n denote the modal logic of chequered subsets of . For every n 1, we characterize L n using the more familiar Kripke semantics, thus implying that each L n is a tabular logic over the well-known modal system Grz of Grzegorczyk. We show that the logics L n form a decreasing chain converging to the logic L of chequered subsets of . As a result, we obtain that L is also a logic over Grz, and that L has the finite model property. We conclude the paper by extending our results to the modal language enriched with the universal modality.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,471

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

On logics with coimplication.Frank Wolter - 1998 - Journal of Philosophical Logic 27 (4):353-387.
What one may come to know.van Benthem Johan - 2004 - Analysis 64 (2):95–105.
The lattice of modal logics: An algebraic investigation.W. J. Blok - 1980 - Journal of Symbolic Logic 45 (2):221-236.
Kripke semantics for modal substructural logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Interpretations of intuitionist logic in non-normal modal logics.Colin Oakes - 1999 - Journal of Philosophical Logic 28 (1):47-60.
A new modal lindström theorem.Johan van Benthem - 2007 - Logica Universalis 1 (1):125-138.

Analytics

Added to PP
2009-01-28

Downloads
64 (#255,000)

6 months
8 (#373,029)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Johan Van Benthem
University of Amsterdam

References found in this work

No references found.

Add more references