Products of 'transitive' modal logics

Journal of Symbolic Logic 70 (3):993-1021 (2005)
Abstract
We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1122038925
Options
 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: 23,201
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
Philip Kremer & Grigori Mints (2005). Dynamic Topological Logic. Annals of Pure and Applied Logic 131 (1-3):133-158.
Mark Reynolds (1997). A Decidable Temporal Logic of Parallelism. Notre Dame Journal of Formal Logic 38 (3):419-436.

View all 8 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index

2010-08-24

Total downloads

12 ( #357,325 of 1,940,949 )

Recent downloads (6 months)

1 ( #457,798 of 1,940,949 )

How can I increase my downloads?

My notes
Sign in to use this feature


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