Journal of Symbolic Logic 64 (1):81 - 98 (1999)
|Abstract||We present a variation of the forcing S max as presented in Woodin . Our forcing is a P max -style construction where each model condition selects one Souslin tree. In the extension there is a Souslin tree T G which is the direct limit of the selected Souslin trees in the models of the generic. In some sense, the generic extension is a maximal model of "there exists a minimal Souslin tree," with T G being this minimal tree. In particular, in the extension this Souslin tree has the property that forcing with it gives a model of Souslin's Hypothesis|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Peter Lars Dordal (1987). A Model in Which the Base-Matrix Tree Cannot Have Cofinal Branches. Journal of Symbolic Logic 52 (3):651-664.
Lucas Champollion (2011). Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete. Journal of Logic, Language and Information 20 (3):343-359.
John Gregory (1976). Higher Souslin Trees and the Generalized Continuum Hypothesis. Journal of Symbolic Logic 41 (3):663-671.
Alessandro Andretta (1991). Building Iteration Trees. Journal of Symbolic Logic 56 (4):1369-1384.
Finn V. Jensen (1974). Interpolation and Definability in Abstract Logics. Synthese 27 (1-2):251 - 257.
Gunter Fuchs & Joel David Hamkins (2008). Changing the Heights of Automorphism Towers by Forcing with Souslin Trees Over L. Journal of Symbolic Logic 73 (2):614-633.
John P. Burgess (1978). On the Hanf Number of Souslin Logic. Journal of Symbolic Logic 43 (3):568-571.
Tadatoshi Miyamoto (2002). On Iterating Semiproper Preorders. Journal of Symbolic Logic 67 (4):1431-1468.
Jaime I. Ihoda & Saharon Shelah (1988). Souslin Forcing. Journal of Symbolic Logic 53 (4):1188-1207.
Added to index2009-01-28
Total downloads2 ( #232,265 of 548,984 )
Recent downloads (6 months)0
How can I increase my downloads?