Proof of ł-decidability of Lewis system S
Studia Logica 32 (1):99 - 107 (1973)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| 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,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesKatsuhiko Sano (2009). Hybrid Counterfactual Logics. Journal of Logic, Language and Information 18 (4).
J. C. C. McKinsey (1940). Proof That There Are Infinitely Many Modalities in Lewis's System S. Journal of Symbolic Logic 5 (3):110 - 112.
Jan Krajíček (2004). Implicit Proofs. Journal of Symbolic Logic 69 (2):387 - 397.
Gemma Robles & José M. Méndez (2010). Paraconsistent Logics Included in Lewis’ S4. Review of Symbolic Logic 3 (03):442-466.
Gemma Robles & José M. Méndez (2010). Paraconsistent Logics Included in Lewis’ S4. Review of Symbolic Logic 3 (03):442-466.
Ming Xu (1994). Decidability Ofstit Theory with a Single Agent Andrefref Equivalence. Studia Logica 53 (2):259 - 298.
Mojżesz Presburger & Dale Jabcquette (1991). On the Completeness of a Certain System of Arithmetic of Whole Numbers in Which Addition Occurs as the Only Operation. History and Philosophy of Logic 12 (2):225-233.
Katsuhiko Sano (2009). Hybrid Counterfactual Logics David Lewis Meets Arthur Prior Again. Journal of Logic, Language and Information 18 (4):515-539.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,830 of 549,080 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
