scholarly journals Characterization of generic extensions of models of set theory

1973 ◽  
Vol 83 (1) ◽  
pp. 35-46 ◽  
Author(s):  
Lev Bukovský
Mathematics ◽  
2021 ◽  
Vol 9 (14) ◽  
pp. 1670
Author(s):  
Ali Enayat ◽  
Vladimir Kanovei ◽  
Vassily Lyubetsky

Examples of effectively indiscernible projective sets of real numbers in various models of set theory are presented. We prove that it is true, in Miller and Laver generic extensions of the constructible universe, that there exists a lightface Π21 equivalence relation on the set of all nonconstructible reals, having exactly two equivalence classes, neither one of which is ordinal definable, and therefore the classes are OD-indiscernible. A similar but somewhat weaker result is obtained for Silver extensions. The other main result is that for any n, starting with 2, the existence of a pair of countable disjoint OD-indiscernible sets, whose associated equivalence relation belongs to lightface Πn1, does not imply the existence of such a pair with the associated relation in Σn1 or in a lower class.


1980 ◽  
Vol 45 (1) ◽  
pp. 9-19
Author(s):  
David Guaspari

Call a set A of ordinals “definable” over a theory T if T is some brand of set theory and whenever A appears in the standard part of a (not necessarily standard) model of T, A is “definable”. Two kinds of “definability” are considered, for each of which is provided a complete (or almost complete) characterization of the hereditarily countable sets of ordinals “definable” over true finitely axiomatizable set theories: (1) there is a single formula ϕ such that in any model of T containing A, A is the unique solution to ϕ; (2) the defining formula is allowed to vary from model to model. (Note. The restrictions “finitely axiomatizable”, and “true” are largely for the sake of convenience: such theories provably have lots of models.)There are few allusions to what a model theorist would regard as his subject—the methods coming from recursion theory and set theory; but the treatment is intended to be intelligible to nonspecialists. The referee's criticisms have greatly improved the exposition.I would like to thank Leo Harrington for several discussions, both helpful and hapless, and especially for a clever and timely proof which rescued this project from a moribund state. (Further thanks are due to the Movshon family, as a result of whose New Year's Eve party it became clear that the only really magic formulas are Σ1 formulas.)


1972 ◽  
Vol 37 (1) ◽  
pp. 81-89 ◽  
Author(s):  
Thomas J. Grilliot

Omitting-types theorems have been useful in model theory to construct models with special characteristics. For instance, one method of proving the ω-completeness theorem of Henkin [10] and Orey [20] involves constructing a model that omits the type {x ≠ 0, x ≠ 1, x ≠ 2,···} (i.e., {x ≠ 0, x ≠ 1, x ≠ 2,···} is not satisfiable in the model). Our purpose in this paper is to illustrate uses of omitting-types theorems in recursion theory. The Gandy-Kreisel-Tait Theorem [7] is the most well-known example. This theorem characterizes the class of hyperarithmetical sets as the intersection of all ω-models of analysis (the so-called hard core of analysis). The usual way to prove that a nonhyperarithmetical set does not belong to the hard core is to construct an ω-model of analysis that omits the type representing the set (Application 1). We will find basis results for and s — sets that are stronger than results previously known (Applications 2 and 3). The question of how far the natural hierarchy of hyperjumps extends was first settled by a forcing argument (Sacks) and subsequently by a compactness argument (Kripke, Richter). Another problem solved by a forcing argument (Sacks) and then by a compactness argument (Friedman-Jensen) was the characterization of the countable admissible ordinals as the relativized ω1's. Using omitting-types technique, we will supply a third kind of proof of these results (Applications 4 and 5). S. Simpson made a significant contribution in simplifying the proof of the latter result, with the interesting side effect that Friedman's result on ordinals in models of set theory is immediate (Application 6). One approach to abstract recursiveness and hyperarithmeticity on a countable set is to tenuously identify the set with the natural numbers. This approach is equivalent to other approaches to abstract recursion (Application 7). This last result may also be proved by a forcing method.


1978 ◽  
Vol 43 (4) ◽  
pp. 635-642 ◽  
Author(s):  
Petr Štěpánek

We shall describe Boolean extensions of models of set theory with the axiom of choice in which cardinals are collapsed by mappings definable from parameters in the ground model. In particular, starting from the constructible universe, we get Boolean extensions in which constructible cardinals are collapsed by ordinal definable sets.Let be a transitive model of set theory with the axiom of choice. Definability of sets in the generic extensions of is closely related to the automorphisms of the corresponding Boolean algebra. In particular, if G is an -generic ultrafilter on a rigid complete Boolean algebra C, then every set in [G] is definable from parameters in . Hence if B is a complete Boolean algebra containing a set of forcing conditions to collapse some cardinals in , it suffices to construct a rigid complete Boolean algebra C, in which B is completely embedded. If G is as above, then [G] satisfies “every set is -definable” and the inner model [G ∩ B] contains the collapsing mapping determined by B. To complete the result, it is necessary to give some conditions under which every cardinal from [G ∩ B] remains a cardinal in [G].The absolutness is granted for every cardinal at least as large as the saturation of C. To keep the upper cardinals absolute, it often suffices to construct C with the same saturation as B. It was shown in [6] that this is always possible, namely, that every Boolean algebra can be completely embedded in a rigid complete Boolean algebra with the same saturation.


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 .


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

Sign in / Sign up

Export Citation Format

Share Document