Prikry forcing and tree Prikry forcing of various filters
From MaRDI portal
Publication:2274128
Abstract: In this paper, we answer a question asked in "A minimal Prikry type forcing for singularizing a measurable cardinal" regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.
Recommendations
Cites work
- A minimal Prikry-type forcing for singularizing a measurable cardinal
- scientific article; zbMATH DE number 3557791 (Why is no real title available?)
- scientific article; zbMATH DE number 1113072 (Why is no real title available?)
- scientific article; zbMATH DE number 3336797 (Why is no real title available?)
- Iterated ultrapowers and prikry forcing
- On sequences generic in the sense of Prikry
- Set theory. An introduction to independence proofs
- Sets in Prikry and Magidor generic extensions
- Some remarks on changing cofinalities
- Some weak versions of large cardinal axioms
- The covering lemma for L[U]
- Ultrafilters over a measurable cardinal
- Ultrafilters over measurable cardinals
Cited in
(10)- Intermediate models of Magidor-Radin forcing. II
- P-filters and Cohen, random, and Laver forcing
- The *-Prikry condition
- A Mathias criterion for the Magidor iteration of Prikry forcings
- Negating the Galvin property
- The variety of projections of a tree Prikry forcing
- Cofinal types of ultrafilters over measurable cardinals
- Galvin's property at large cardinals and an application to partition calculus
- The gluing property
- LST numbers for \(Q^{e.c.}\) and \(I\) style quantifiers
This page was built for publication: Prikry forcing and tree Prikry forcing of various filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274128)