Perfect trees and elementary embeddings

Journal of Symbolic Logic 73 (3):906-918 (2008)
  Copy   BIBTEX

Abstract

An important technique in large cardinal set theory is that of extending an elementary embedding j: M → N between inner models to an elementary embedding j*: M[G] → N[G*] between generic extensions of them. This technique is crucial both in the study of large cardinal preservation and of internal consistency. In easy cases, such as when forcing to make the GCH hold while preserving a measurable cardinal (via a reverse Easton iteration of α-Cohen forcing for successor cardinals α), the generic G* is simply generated by the image of G. But in difficult cases, such as in Woodin's proof that a hypermeasurable is sufficient to obtain a failure of the GCH at a measurable, a preliminary version of G* must be constructed (possibly in a further generic extension of M[G]) and then modified to provide the required G*. In this article we use perfect trees to reduce some difficult cases to easy ones, using fusion as a substitute for distributivity. We apply our technique to provide a new proof of Woodin's theorem as well as the new result that global domination at inaccessibles (the statement that d (κ) is less than 2κ for inaccessible κ, where d (κ) is the dominating number at κ) is internally consistent, given the existence of 0#

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Standardization principle of nonstandard universes.Masahiko Murakami - 1999 - Journal of Symbolic Logic 64 (4):1645-1655.
On generic elementary embeddings.Moti Gitik - 1989 - Journal of Symbolic Logic 54 (3):700-707.
Nonabsoluteness of elementary embeddings.Friedrich Wehrung - 1989 - Journal of Symbolic Logic 54 (3):774-778.
Indescribable cardinals and elementary embeddings.Kai Hauser - 1991 - Journal of Symbolic Logic 56 (2):439-457.
Skolem functions and elementary embeddings.Julia F. Knight - 1977 - Journal of Symbolic Logic 42 (1):94-98.
Elementary embeddings and infinitary combinatorics.Kenneth Kunen - 1971 - Journal of Symbolic Logic 36 (3):407-413.
Co-critical points of elementary embeddings.Michael Sheard - 1985 - Journal of Symbolic Logic 50 (1):220-226.
Canonical simplification of finite objects, well quasi-ordered by tree embedding.Thomas C. Brown - 1979 - Urbana, Ill.: Dept. of Computer Science, University of Illinois at Urbana-Champaign.
Forcing with Δ perfect trees and minimal Δ-degrees.Alexander S. Kechris - 1981 - Journal of Symbolic Logic 46 (4):803 - 816.
Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.

Analytics

Added to PP
2010-09-12

Downloads
43 (#352,595)

6 months
16 (#138,396)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Fusion and large cardinal preservation.Sy-David Friedman, Radek Honzik & Lyubomyr Zdomskyy - 2013 - Annals of Pure and Applied Logic 164 (12):1247-1273.
Easton’s theorem and large cardinals.Sy-David Friedman & Radek Honzik - 2008 - Annals of Pure and Applied Logic 154 (3):191-208.
A Laver-like indestructibility for hypermeasurable cardinals.Radek Honzik - 2019 - Archive for Mathematical Logic 58 (3-4):275-287.
Easton’s theorem in the presence of Woodin cardinals.Brent Cody - 2013 - Archive for Mathematical Logic 52 (5-6):569-591.
Global singularization and the failure of SCH.Radek Honzik - 2010 - Annals of Pure and Applied Logic 161 (7):895-915.

View all 10 citations / Add more citations

References found in this work

The negation of the singular cardinal hypothesis from o(K)=K++.Moti Gitik - 1989 - Annals of Pure and Applied Logic 43 (3):209-234.
Perfect-set forcing for uncountable cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.
Cardinal invariants above the continuum.James Cummings & Saharon Shelah - 1995 - Annals of Pure and Applied Logic 75 (3):251-268.
Minimal α-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393-414.
Minimal alpha-degrees.Richard A. Shore - 1972 - Annals of Mathematical Logic 4 (4):393.

Add more references