About Prikry generic extensions

DOI10.1016/0168-0072(91)90018-HzbMath0813.03033OpenAlexW2013565066MaRDI QIDQ1814134

Claude Sureson

Publication date: 25 June 1992

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(91)90018-h

zbMATH Keywords

measurable cardinalleast upper boundMathias forcinggreatest lower boundPrikry-generic sequence

Mathematics Subject Classification ID

Consistency and independence results (03E35) Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55) Other aspects of forcing and Boolean-valued models (03E40)

Related Items (1)

Symmetric submodels of a Cohen generic extension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set theory. An introduction to independence proofs
• A model of set-theory in which every set of reals is Lebesgue measurable
• Iterated ultrapowers and prikry forcing
• The covering lemma for K
• Happy families
• Some applications of iterated ultrapowers in set theory
• On sequences generic in the sense of Prikry

This page was built for publication: About Prikry generic extensions