Forcing in Łukasiewicz Predicate Logic
Studia Logica 89 (1):111 - 145 (2008)
| Abstract | In this paper we study the notion of forcing for Łukasiewicz predicate logic (Łᗄ, for short), along the lines of Robinson's forcing in classical model theory. We deal with both finite and infinite forcing. As regard to the former we prove a Generic Model Theorem for Łᗄ, while for the latter, we study the generic and existentially complete standard models of Łᗄ. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,631 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesAntonio Di Nola, George Georgescu & Luca Spada (2008). Forcing in Łukasiewicz Predicate Logic. Studia Logica 89 (1).
Joan Bagaria & Roger Bosch (2004). Solovay Models and Forcing Extensions. Journal of Symbolic Logic 69 (3):742-766.
M. C. Laskowski & S. Shelah (1996). Forcing Isomorphism II. Journal of Symbolic Logic 61 (4):1305-1320.
Jeremy Avigad (2004). Forcing in Proof Theory. Bulletin of Symbolic Logic 10 (3):305-333.
Mark Howard (1988). A Proofless Proof of the Barwise Compactness Theorem. Journal of Symbolic Logic 53 (2):597-602.
Todd Eisworth (2002). Forcing and Stable Ordered-Union Ultrafilters. Journal of Symbolic Logic 67 (1):449-464.
Paul Larson (1999). An Smax Variation for One Souslin Tree. Journal of Symbolic Logic 64 (1):81 - 98.
Stamatios Gerogiorgakis (2012). Privations, Negations and the Square: Basic Elements of a Logic of Privations. In Jean-Yves Beziau & Dale Jacquette (eds.), Around and beyond the Square of Opposition. Birkhäuser-Springer.
Jaime I. Ihoda & Saharon Shelah (1988). Souslin Forcing. Journal of Symbolic Logic 53 (4):1188-1207.
George Georgescu (2010). States on Polyadic Mv-Algebras. Studia Logica 94 (2).
Saharon Shelah & Lee J. Stanley (2001). Forcing Many Positive Polarized Partition Relations Between a Cardinal and its Powerset. Journal of Symbolic Logic 66 (3):1359-1370.
Joel David Hamkins (1998). Small Forcing Makes Any Cardinal Superdestructible. Journal of Symbolic Logic 63 (1):51-58.
Amir Leshem & Menachem Magidor (1999). The Independence of Δ1n. Journal of Symbolic Logic 64 (1):350 - 362.
Arthur W. Apter (1998). Laver Indestructibility and the Class of Compact Cardinals. Journal of Symbolic Logic 63 (1):149-157.
Alan H. Mekler (1984). C. C. C. Forcing Without Combinatorics. Journal of Symbolic Logic 49 (3):830-832.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2011-05-29Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
