A simple incomplete extension of T which is the union of two complete modal logics with F.m.P
Journal of Philosophical Logic 31 (6):527-541 (2002)
| Abstract | I present here a modal extension of T called KTLM which is, by several measures, the simplest modal extension of T yet presented. Its axiom uses only one sentence letter and has a modal depth of 2. Furthermore, KTLM can be realized as the logical union of two logics KM and KTL which each have the finite model property (f.m.p.), and so themselves are complete. Each of these two component logics has independent interest as well | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesW. J. Blok (1979). An Axiomatization of the Modal Theory of the Veiled Recession Frame. Studia Logica 38 (1):37 - 47.
Lou Goble (2000). An Incomplete Relevant Modal Logic. Journal of Philosophical Logic 29 (1):103-119.
D. M. Gabbay (2002). A Theory of Hypermodal Logics: Mode Shifting in Modal Logic. Journal of Philosophical Logic 31 (3):211-243.
M. J. Cresswell (1995). Incompleteness and the Barcan Formula. Journal of Philosophical Logic 24 (4):379 - 403.
S. K. Thomason (1980). Independent Propositional Modal Logics. Studia Logica 39 (2-3):143 - 144.
Tadeusz Litak (2004). Modal Incompleteness Revisited. Studia Logica 76 (3):329 - 342.
David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev (2005). Products of 'Transitive' Modal Logics. Journal of Symbolic Logic 70 (3):993 - 1021.
V. V. Rybakov (1995). Hereditarily Structurally Complete Modal Logics. Journal of Symbolic Logic 60 (1):266-288.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads11 ( #99,573 of 549,128 )Recent downloads (6 months)1 ( #63,361 of 549,128 )How can I increase my downloads? |
My notes
Discussion
