Journal of Symbolic Logic 64 (1):81 - 98 (1999)
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)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
A Model in Which the Base-Matrix Tree Cannot Have Cofinal Branches.Peter Lars Dordal - 1987 - Journal of Symbolic Logic 52 (3):651-664.
Lexicalized Non-Local MCTAG with Dominance Links is NP-Complete.Lucas Champollion - 2011 - Journal of Logic, Language and Information 20 (3):343-359.
Higher Souslin Trees and the Generalized Continuum Hypothesis.John Gregory - 1976 - Journal of Symbolic Logic 41 (3):663-671.
Interpolation and Definability in Abstract Logics.Finn V. Jensen - 1974 - Synthese 27 (1-2):251 - 257.
Changing the Heights of Automorphism Towers by Forcing with Souslin Trees Over L.Gunter Fuchs & Joel David Hamkins - 2008 - Journal of Symbolic Logic 73 (2):614 - 633.
On the Hanf Number of Souslin Logic.John P. Burgess - 1978 - Journal of Symbolic Logic 43 (3):568-571.
On Iterating Semiproper Preorders.Tadatoshi Miyamoto - 2002 - Journal of Symbolic Logic 67 (4):1431-1468.
Added to index2009-01-28
Total downloads8 ( #476,171 of 2,143,792 )
Recent downloads (6 months)1 ( #387,162 of 2,143,792 )
How can I increase my downloads?
There are no threads in this forum
Nothing in this forum yet.