We generalize the ultrapower in a way suitable for choiceless set theory. Given an ultrafilter, forcing is used to construct an extended ultrapower of the universe, designed so that the fundamental theorem of ultrapowers holds even in the absence of the axiom of choice. If, in addition, we assume DC, then an extended ultrapower of the universe by a countably complete ultrafilter must be well-founded. As an application, we prove the Vopěnka-Hrbáček theorem from ZF + DC only (the proof of (...) Vopěnka and Hrbáček used the full axiom of choice): if there exists a strongly compact cardinal, then the universe is not constructible from a set. The same method shows that, in L[ 2 ω ], there cannot exist a θ-compact cardinal less than θ (where θ is the least cardinal onto which the continuum cannot be mapped); a similar result can be proven for other models of the form L[ A ]. The result for L[ 2 ω ] is of particular interest in connection with the axiom of determinacy. The extended ultrapower construction of this paper is an improved version of the author's earlier pseudo-ultrapower method, making use of forcing rather than the omitting types theorem. (shrink)

A new method is presented for constructing models of set theory, using a technique of forming pseudo-ultrapowers. In the presence of the axiom of choice, the traditional ultrapower construction has proven to be extremely powerful in set theory and model theory; if the axiom of choice is not assumed, the fundamental theorem of ultrapowers may fail, causing the ultrapower to lose almost all of its utility. The pseudo-ultrapower is designed so that the fundamental theorem holds even if choice fails; this (...) is arranged by means of an application of the omitting types theorem. The general theory of pseudo-ultrapowers is developed. Following that, we study supercompactness in the absence of choice, and we analyze pseudo-ultrapowers of models of the axiom of determinateness and various infinite exponent partition relations. Relationships between pseudo-ultrapowers and forcing are also discussed. (shrink)

Working in ZF + DC with no additional use of the axiom of choice, we show how to iterate the extended ultrapower construction of Spector . This generalizes the technique of iterated ultrapowers to choiceless set theory. As an application, we prove the following theorem: Assume V = LU[κ] + “κ is λ-supercompact with normal ultrafilter U” + DC. Then for every sufficiently large regular cardinal ρ, there exists a set-generic extension V[G] of the universe in which there exists for (...) some σ a set S ρ for which one can define an elementary embedding j mapping V to LD[S], where D is the filter in V[G] generated by the closed unbounded filter on ρ. Moreover, we have j = ρ, j = σ, j) = S according to LD[S]), and j = D ∩ LD[S] i s a normal ultrafilter in LD[S] on ρ. (shrink)

We initiate the study of model theory in the absence of the Axiom of Choice, using the Axiom of Determinateness as a powerful substitute. We first show that, in this context, L ω 1 ω is no more powerful than first-order logic. The emphasis then turns to upward Lowenhein-Skolem theorems; ℵ 1 is the Hanf number of first-order logic, of L ω 1 ω , and of a strong fragment of L ω 1 ω . The main technical innovation is (...) the development of iterated ultrapowers using infinite supports; this requires an application of infinite-exponent partition relations. All our theorems can be proven from hypotheses weaker than AD. (shrink)