T Ã W Completeness
Journal of Philosophical Logic 26 (3):241-250 (1997)
| Abstract | T Ã W logic is a combination of tense and modal logic for worlds or histories with the same time order. It is the basis for logics of causation, agency and conditionals, and therefore an important tool for philosophical logic. Semantically it has been defined, among others, by R. H. Thomason. Using an operator expressing truth in all worlds, first discussed by C. M. Di Maio and A. Zanardo, an axiomatization is given and its completeness proved via D. Gabbayâs irreflexivity lemma. Given this lemma the proof is more or less straight forward. At the end an alternative axiomatization is sketched in which Di Maioâs and Zanardoâs operator is replaced by a version of actually | |||||||||
| 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,653 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesFranz von Kutschera (1997). T × W Completeness. Journal of Philosophical Logic 26 (3):241 - 250.
Lennart Åqvist (1999). The Logic of Historical Necessity as Founded on Two-Dimensional Modal Tense Logic. Journal of Philosophical Logic 28 (4):329-369.
Stefan Wölfl (2002). Propositional Q-Logic. Journal of Philosophical Logic 31 (5):387-414.
Stéphane Demri (1997). A Completeness Proof for a Logic with an Alternative Necessity Operator. Studia Logica 58 (1):99-112.
J. F. A. K. Benthem (1980). Some Kinds of Modal Completeness. Studia Logica 39 (2-3):125 - 141.
Roberto Ciuni & Alberto Zanardo (2010). Completeness of a Branching-Time Logic with Possible Choices. Studia Logica 96 (3):393-420.
Gerard Renardel de Lavalette, Barteld Kooi & Rineke Verbrugge (2008). Strong Completeness and Limited Canonicity for PDL. Journal of Logic, Language and Information 17 (1).
Richard Kaye (2007). The Mathematics of Logic: A Guide to Completeness Theorems and Their Applications. Cambridge University Press.
Maarten Marx, Szabolcs Mikul & István Németi (1995). Taming Logic. Journal of Logic, Language and Information 4 (3):207-226.
Dick Jongh, Marc Jumelet & Franco Montagna (1991). On the Proof of Solovay's Theorem. Studia Logica 50 (1):51 - 69.
D. M. Gabbay & G. Malod (2002). Naming Worlds in Modal and Temporal Logic. Journal of Logic, Language and Information 11 (1):29-65.
Frank Wolter (1997). Completeness and Decidability of Tense Logics Closely Related to Logics Above K. Journal of Symbolic Logic 62 (1):131-158.
Maria Concetta Di Maio & Alberto Zanardo (1998). A Gabbay-Rule Free Axiomatization of T X W Validity. Journal of Philosophical Logic 27 (5):435 - 487.
Giovanna Corsi (2002). A Unified Completeness Theorem for Quantified Modal Logics. Journal of Symbolic Logic 67 (4):1483-1510.
George Gargov & Valentin Goranko (1993). Modal Logic with Names. Journal of Philosophical Logic 22 (6):607 - 636.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-09-01Total downloads1 ( #274,556 of 548,984 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
