Euclidean hierarchy in modal logic

Studia Logica 75 (3):327-344 (2003)
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.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/B:STUD.0000009564.00287.16
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,974
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Marco Aiello & Johan van Benthem (2002). A ModalWalk Through Space. Journal of Applied Non-Classical Logics 12 (3-4):319-363.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

19 ( #145,294 of 1,725,806 )

Recent downloads (6 months)

6 ( #110,125 of 1,725,806 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.