scholarly journals Models of Set Theory in which Nonconstructible Reals First Appear at a Given Projective Level

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 910 ◽  
Author(s):  
Vladimir Kanovei ◽  
Vassily Lyubetsky

Models of set theory are defined, in which nonconstructible reals first appear on a given level of the projective hierarchy. Our main results are as follows. Suppose that n ≥ 2 . Then: 1. If it holds in the constructible universe L that a ⊆ ω and a ∉ Σ n 1 ∪ Π n 1 , then there is a generic extension of L in which a ∈ Δ n + 1 1 but still a ∉ Σ n 1 ∪ Π n 1 , and moreover, any set x ⊆ ω , x ∈ Σ n 1 , is constructible and Σ n 1 in L . 2. There exists a generic extension L in which it is true that there is a nonconstructible Δ n + 1 1 set a ⊆ ω , but all Σ n 1 sets x ⊆ ω are constructible and even Σ n 1 in L , and in addition, V = L [ a ] in the extension. 3. There exists an generic extension of L in which there is a nonconstructible Σ n + 1 1 set a ⊆ ω , but all Δ n + 1 1 sets x ⊆ ω are constructible and Δ n + 1 1 in L . Thus, nonconstructible reals (here subsets of ω ) can first appear at a given lightface projective class strictly higher than Σ 2 1 , in an appropriate generic extension of L . The lower limit Σ 2 1 is motivated by the Shoenfield absoluteness theorem, which implies that all Σ 2 1 sets a ⊆ ω are constructible. Our methods are based on almost-disjoint forcing. We add a sufficient number of generic reals to L , which are very similar at a given projective level n but discernible at the next level n + 1 .

2003 ◽  
Vol 68 (2) ◽  
pp. 389-418 ◽  
Author(s):  
M. C. Stanley

Why is forcing the only known method for constructing outer models of set theory?If V is a standard transitive model of ZFC, then a standard transitive model W of ZFC is an outer model of V if V ⊆ W and V ∩ OR = W ∩ OR.Is every outer model of a given model a generic extension? At one point Solovay conjectured that if 0# exists, then every real that does not construct 0# lies in L[G], for some G that is generic for some forcing ℙ ∈ L. Famously, this was refuted by Jensen's coding theorem. He produced a real that is generic for an L-definable class forcing property, but does not lie in any set forcing extension of L.Beller, Jensen, and Welch in Coding the universe [BJW] revived Solovay's conjecture by asking the following question: Let a ⊆ ω be such that L[a] ⊨ “0# does not exist”. Is there ab∈ L[a] such that a ∉ L[b] and a is set generic over L[b].


1982 ◽  
Vol 47 (4) ◽  
pp. 739-754
Author(s):  
C.P. Farrington

This paper is devoted to the proof of the following theorem.Theorem. Let M be a countable standard transitive model of ZF + V = L, and let ℒ Є M be a wellfounded lattice in M, with top and bottom. Let ∣ℒ∣M = λ, and suppose κ ≥ λ is a regular cardinal in M. Then there is a generic extension N of M such that(i) N and M have the same cardinals, and κN ⊂ M;(ii) the c-degrees of sets of ordinals of N form a pattern isomorphic to ℒ;(iii) if A ⊂ On and A Є N, there is B Є P(κ+)N such that L(A) = L(B).The proof proceeds by forcing with Souslin trees, and relies heavily on techniques developed by Jech. In [5] he uses these techniques to construct simple Boolean algebras in L, and in [6] he uses them to construct a model of set theory whose c-degrees have orderlype 1 + ω*.The proof also draws on ideas of Adamovicz. In [1]–[3] she obtains consistency results concerning the possible patterns of c-degrees of sets of ordinals using perfect set forcing and symmetric models. These methods have the advantage of yielding real degrees, but involve greater combinatorial complexity, in particular the use of ‘sequential representations’ of lattices.The advantage of the approach using Souslin trees is twofold: first, we can make use of ready-made combinatorial principles which hold in L, and secondly, the notion of genericity over a Souslin tree is particularly simple.


2000 ◽  
Vol 39 (7) ◽  
pp. 509-514 ◽  
Author(s):  
James H. Schmerl

1984 ◽  
Vol 24 (5) ◽  
pp. 735-746 ◽  
Author(s):  
A. G. Kusraev ◽  
S. S. Kutateladze

2019 ◽  
Vol 116 (38) ◽  
pp. 18883-18887 ◽  
Author(s):  
David Schrittesser ◽  
Asger Törnquist

We show that if all collections of infinite subsets of N have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. The implication is proved in Zermelo–Fraenkel set theory with only weak choice principles. This gives a positive solution to a long-standing problem that goes back to Mathias [A. R. D. Mathias, Ann. Math. Logic 12, 59–111 (1977)]. The proof exploits an idea which has its natural roots in ergodic theory, topological dynamics, and invariant descriptive set theory: We use that a certain function associated to a purported mad family is invariant under the equivalence relation E0 and thus is constant on a “large” set. Furthermore, we announce a number of additional results about mad families relative to more complicated Borel ideals.


1998 ◽  
Vol 63 (3) ◽  
pp. 1116-1136 ◽  
Author(s):  
Andrés Villaveces

AbstractLarge cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained in this fashion (‘unfoldable cardinals’) lie in the boundary of the propositions consistent with ‘V = L’ and the existence of 0#. We also provide an ‘embedding characterisation’ of the unfoldable cardinals and study their preservation and destruction by various forcing constructions.


Sign in / Sign up

Export Citation Format

Share Document