Iterated extended ultrapowers and supercompactness without choice

Annals of Pure and Applied Logic 54 (2):179-194 (1991)
  Copy   BIBTEX

Abstract

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 ρ

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,665

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Filters and large cardinals.Jean-Pierre Levinski - 1995 - Annals of Pure and Applied Logic 72 (2):177-212.
Ultrafilters generated by a closed set of functions.Greg Bishop - 1995 - Journal of Symbolic Logic 60 (2):415-430.
Iterated ultrapowers and prikry forcing.Patrick Dehornoy - 1978 - Annals of Mathematical Logic 15 (2):109-160.
Easton’s theorem and large cardinals.Sy-David Friedman & Radek Honzik - 2008 - Annals of Pure and Applied Logic 154 (3):191-208.
Lifting elementary embeddings j: V λ → V λ. [REVIEW]Paul Corazza - 2007 - Archive for Mathematical Logic 46 (2):61-72.
Splitting stationary sets in.Toshimichi Usuba - 2012 - Journal of Symbolic Logic 77 (1):49-62.
Spector forcing.J. M. Henle - 1984 - Journal of Symbolic Logic 49 (2):542-554.

Analytics

Added to PP
2014-01-16

Downloads
34 (#652,735)

6 months
7 (#666,407)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Infinitesimal analysis without the Axiom of Choice.Karel Hrbacek & Mikhail G. Katz - 2021 - Annals of Pure and Applied Logic 172 (6):102959.

Add more citations

References found in this work

Strong axioms of infinity and elementary embeddings.Robert M. Solovay - 1978 - Annals of Mathematical Logic 13 (1):73.
On the determinacy of games on ordinals.L. A. Harrington - 1981 - Annals of Mathematical Logic 20 (2):109.
Some applications of iterated ultrapowers in set theory.Kenneth Kunen - 1970 - Annals of Mathematical Logic 1 (2):179.

View all 6 references / Add more references