Large cardinals and definable well-orders on the universe

@article{BrookeTaylor2009LargeCA,
  title={Large cardinals and definable well-orders on the universe},
  author={Andrew D. Brooke-Taylor},
  journal={The Journal of Symbolic Logic},
  year={2009},
  volume={74},
  pages={641 - 654}
}
  • A. Brooke-Taylor
  • Published 16 November 2007
  • Mathematics
  • The Journal of Symbolic Logic
Abstract We use a reverse Easton forcing iteration to obtain a universe with a definable well-order, while preserving the GCH and proper classes of a variety of very large cardinals. This is achieved by coding using the principle , at a proper class of cardinals κ. By choosing the cardinals at which coding occurs sufficiently sparsely, we are able to lift the embeddings witnessing the large cardinal properties without having to meet any non-trivial master conditions. 

LARGE CARDINALS AND LIGHTFACE DEFINABLE WELL-ORDERS, WITHOUT THE GCH

TLDR
A class forcing is constructed that adds a well-order at every inaccessible cardinal and preserves ZFC, all cofinalities, the continuum function, and all supercompact cardinals and can apply the forcing to answer a question about the definable failure of the GCH at a measurable cardinal.

Coding into HOD via normal measures with some applications

We develop a new method for coding sets while preserving GCH in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carried by a measurable

Large cardinals need not be large in HOD

HOD, V AND THE GCH

  • M. Golshani
  • Mathematics, Economics
    The Journal of Symbolic Logic
  • 2017
TLDR
Starting from large cardinals, a model of ZFC is constructed in which the GCH fails everywhere, but such that GCH holds in its HOD.

Strong combinatorial principles and level by level equivalence

We construct via forcing models for the level by level equivalence between strong compactness and supercompactness in which δ holds on a stationary subset A of the least supercompact cardinal. We may

More on the preservation of large cardinals under class forcing

We introduce first the large-cardinal notion of $\Sigma_n$-super\-com\-pact\-ness as a higher-level analog of the well-known Magidor's characterization of supercompact cardinals, and show that a

Subcompact cardinals, squares, and stationary reflection

We generalise Jensen’s result on the incompatibility of subcompactness with □. We show that α+-subcompactness of some cardinal less than or equal to α precludes $${\square _\alpha }$$, but also that

Inner models with large cardinal features usually obtained by forcing

TLDR
A variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals are constructed, and three general proof methods are described, which can be used to prove many similar results.

Indestructibility of Vopěnka’s Principle

TLDR
Vopěnka’s Principle and VopĚnka cardinals are shown to be indestructible under a broad class of forcing constructions, specifically, reverse Easton iterations of increasingly directed closed partial orders.

References

SHOWING 1-10 OF 45 REFERENCES

Elementary Embeddings and Infinitary Combinatorics

TLDR
One of the standard ways of postulating large cardinal axioms is to consider elementary embeddings, j, from the universe, V into some transitive submodel, M, and it is shown that whenever κ is measurable, there is such j and M .

Large cardinals and gap-1 morasses

Gap Forcing: Generalizing the Lévy-Solovay Theorem

  • J. Hamkins
  • Mathematics
    Bulletin of Symbolic Logic
  • 1999
TLDR
A generalization of the Levy-Solovay Theorem to a broad new class of forcing notions is announced, which limits the kind of large cardinal embeddings that can exist in a small forcing extension.

Iterated Forcing and Elementary Embeddings

I give a survey of some forcing techniques which are useful in the study of large cardinals and elementary embeddings. The main theme is the problem of extending a (possibly generic) elementary

Large cardinals and $L$-like universes

TLDR
The possibilities for this assertion of V = L, asserting that every set is constructible, are explored, for various notions of " L-like " and for various types of large cardinals.

The Lottery Preparation

  • J. Hamkins
  • Environmental Science
    Ann. Pure Appl. Log.
  • 2000

Generic embeddings and the failure of box

We prove that if {a C K+ I order type of a is a cardinal} is stationary, then Jensen's principle OK fails. We also show that VKEIK is consistent with a superstrong cardinal.

Indexed squares

We study some combinatorial principles intermediate between square and weak square. We construct models which distinguish various square principles, and show that a strengthened form of weak square

Fragile measurability

  • J. Hamkins
  • Mathematics
    Journal of Symbolic Logic
  • 1994
Abstract Laver [L] and others [G-S] have shown how to make the supercompactness or strongness of κ indestructible by a wide class of forcing notions. We show, alternatively, how to make these