Saturation Properties of Ideals in Generic Extensions. I

DOI10.2307/1999861zbMath0485.03022MaRDI QIDQ3944590

Alan D. Taylor, James E. Baumgartner

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/1999861

zbMATH Keywords

Martin's axiom; covering property; GCH; countable chain condition; saturated ideals; forcing with partial orderings; negative preservation

Mathematics Subject Classification ID

03E35: Consistency and independence results

03E55: Large cardinals

03E50: Continuum hypothesis and Martin's axiom

03E05: Other combinatorial set theory

Related Items

Less saturated ideals, The nonstationary ideal and the other 𝜎-ideals on 𝜔₁, Potent Axioms, Complete Quotient Boolean Algebras, Two cardinal versions of diamond, More game-theoretic properties of Boolean algebras, On the structure of stationary sets, Game ideals, Menas' conjecture and generic ultrapowers, On the size of closed unbounded sets, Forcing axioms and stationary sets, On the weak distributivity game, Large cardinals and definable counterexamples to the continuum hypothesis, The extent of strength in the club filters, Splitting \({\mathcal P}_\kappa \lambda\) into maximally many stationary sets, Local saturation of the non-stationary ideal over \(\mathcal P_{\kappa}\lambda\), Thin stationary sets and disjoint club sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial set theory: Partition relations for cardinals
• Making the supercompactness of \(\nu\) indestructible under \(\nu\)-directed closed forcing
• Saturated Ideals in Boolean Extensions
• The Saturation of a Product of Ideals
• Perfect-set forcing for uncountable cardinals
• The core model
• On saturated sets of ideals and Ulam's problem
• Saturation Properties of Ideals in Generic Extensions.II
• On strong compactness and supercompactness
• Canonical Partition Relations
• Almost-disjoint sets the dense set problem and the partition calculus
• Consistency Results Concerning Supercompactness
• Some Combinatorial Principles
• Countable approximations and Löwenheim-Skolem theorems
• On splitting stationary subsets of large cardinals
• Changing cofinality of cardinals
• Saturated ideals
• Ideals over uncountable sets: application of almost disjoint functions and generic ultrapowers
• Regularity properties of ideals and ultrafilters
• The Pigeon-Hole Principle for Ordinal Numbers
• Boolean extensions and measurable cardinals
• Some combinatorial problems concerning uncountable cardinals