Calculating quotient algebras of generic embeddings

@article{Foreman2013CalculatingQA,
  title={Calculating quotient algebras of generic embeddings},
  author={Matthew D. Foreman},
  journal={Israel Journal of Mathematics},
  year={2013},
  volume={193},
  pages={309-341}
}
  • M. Foreman
  • Published 2013
  • Mathematics
  • Israel Journal of Mathematics
Many consistency results in set theory involve forcing over a universe V0 that contains a large cardinal to get a model V1. The original large cardinal embedding is then extended generically using a further forcing by a partial ordering ℚ. Determining the properties of ℚ is often the crux of the consistency result. Standard techniques can usually be used to reduce to the case where ℚ is of the form P(Z)/J for appropriately chosen Z and countably complete ideal J. This paper proves a general… 

Indestructibility of generically strong cardinals

Foreman (For13) proved the Duality Theorem, which gives an al- gebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of

CHANG’S CONJECTURE, GENERIC ELEMENTARY EMBEDDINGS AND INNER MODELS FOR HUGE CARDINALS

  • M. Foreman
  • Mathematics
    The Bulletin of Symbolic Logic
  • 2015
TLDR
It is proved that a natural principle Strong Chang Reflection implies the existence of an inner model with a huge cardinal and this principle is between a huge and a two huge cardinal in consistency strength.

Specialising Trees With Small Approximations II

We show that the existence of a well-known type of ideals on a regular cardinal λ implies a compactness property concerning the specialisability of a tree of height λ with no cofinal branches. We

Prikry-type forcings after collapsing a huge cardinal

. Some models of combinatorial principles have been obtained by collapsing a huge cardinal in the case of the successors of regular cardinals. For example, saturated ideals, Chang’s conjecture,

Strong independence and its spectrum

For μ, κ infinite, say A ⊆ [κ] is a (μ, κ)-maximal independent family if whenever A0 and A1 are pairwise disjoint non-empty in [A] <μ then ⋂ A0\ ⋃ A1 6= ∅, A is maximal under inclusion among families

Strongly proper forcing and some problems of Foreman

We answer several questions of Foreman, most of which are closely related to Mitchell’s notion of strongly proper forcing. We prove that presaturation of a normal ideal implies projective antichain

Local saturation of the nonstationary ideals

We show that it is consistent relative to a huge cardinal that for all regular cardinals $\kappa$, there is a stationary $S \subseteq \kappa$ such that $\mathrm{NS}_\kappa \restriction S$ is

GENERIC LARGE CARDINALS AND SYSTEMS OF FILTERS

TLDR
The notion of ${\cal C}$ -system of filters is introduced, generalizing the standard definitions of both extenders and towers of normal ideals and investigating the topic of definability of generic large cardinals properties.

Nonregular ideals

Most of the regularity properties of ideals introduced by Taylor are equivalent at successor cardinals. For $\kappa = \mu^+$ with $\mathrm{cf}(\mu)$ uncountable, we can rid the universe of dense

DENSE IDEALS AND CARDINAL ARITHMETIC

TLDR
From large cardinals, the interplay between dense ideals, cardinal arithmetic, and squares is explored, answering some open questions of Foreman.

References

SHOWING 1-10 OF 13 REFERENCES

Saturation properties of ideals in generic extensions. I

We consider saturation properties of ideals in models obtained by forcing with countable chain condition partial orderings. As sample results, we mention the following. If M[G] is obtained from a

On a condition for Cohen extensions which preserve precipitous ideals

  • Y. Kakuda
  • Mathematics
    Journal of Symbolic Logic
  • 1981
T. Jech and K. Prikry introduced the concept of precipitous ideals as a counterpart of measurable cardinals for small cardinals (Jech and Prikry [1]). To get a precipitous ideal on ℵ1( W. Mitchell

Ideals and Generic Elementary Embeddings

This chapter covers the technique of generic elementary embeddings. These embeddings are closely analogous to conventional large cardinal embeddings, the difference being that they are definable in

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

Handbook of Set Theory

Handbook of Set Theory, Volume I, Akihiro Kanamori, 0. Introduction Thomas Jech, 1. Stationary Sets Andras Hajnal and Jean Larson, 2. Partition Relations Stevo Todorcevic, 3. Coherent Sequences Greg

Martin's Maximum, saturated ideals and non-regular ultrafilters. Part II

We prove, assuming the existence of a huge cardinal, the consistency of fully non-regular ultrafilters on the successor of any regular cardinal. We also construct ultrafilters with ultraproducts of

The Club Guessing Ideal: Commentary on a Theorem of Gitik and Shelah

It is shown in this paper that it is consistent (relative to almost huge cardinals) for various club guessing ideals to be saturated.