Complete modalization in $S4.4$ and $S4.0.4$
Notre Dame Journal of Formal Logic 10 (3):257-260 (1969)
| 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,709 |
| External links |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesJ. Rasga, A. Sernadas & C. Sernadas (2013). Importing Logics: Soundness and Completeness Preservation. [REVIEW] Studia Logica 101 (1):117-155.
Anand Pillay & Charles Steinhorn (1987). On Dedekind Complete o-Minimal Structures. Journal of Symbolic Logic 52 (1):156-164.
Masanao Ozawa (1995). Scott Incomplete Boolean Ultrapowers of the Real Line. Journal of Symbolic Logic 60 (1):160-171.
Darrel E. Christensen (1982). On Rendering Whitehead's “Complete Fact” Complete. Idealistic Studies 12 (2):135-155.
Thomas Jech & Saharon Shelah (1996). On Countably Closed Complete Boolean Algebras. Journal of Symbolic Logic 61 (4):1380-1386.
Hiroakira Ono (2003). Closure Operators and Complete Embeddings of Residuated Lattices. Studia Logica 74 (3):427 - 440.
Liang Yu & Decheng Ding (2004). There Is No SW-Complete C.E. Real. Journal of Symbolic Logic 69 (4):1163 - 1170.
Nuel D. Belnap & Storrs McCall (1970). Every Functionally Complete $M$-Valued Logic has a Post-Complete Axiomatization. Notre Dame Journal of Formal Logic 11 (1):106-106.
Qi Feng (1989). An Ideal Characterization of Mahlo Cardinals. Journal of Symbolic Logic 54 (2):467-473.
Anand Pillay (1994). Definability of Types, and Pairs of o-Minimal Structures. Journal of Symbolic Logic 59 (4):1400-1409.
Alex Thompson (2006). A Metamathematical Condition Equivalent to the Existence of a Complete Left Invariant Metric for a Polish Group. Journal of Symbolic Logic 71 (4):1108 - 1124.
Tadeusz Litak & Frank Wolter (2005). All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-Complete. Studia Logica 81 (2):153 - 165.
Andrei Voronkov (1999). The Ground-Negative Fragment of First-Order Logic is Πp2-Complete. Journal of Symbolic Logic 64 (3):984 - 990.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2010-08-24Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
