Coding into 𝐾 by reasonable forcing

DOI10.1090/S0002-9947-00-02636-2zbMath0960.03043arXivmath/9706208OpenAlexW1870892404MaRDI QIDQ4517449

Ralf-Dieter Schindler

Publication date: 22 November 2000

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9706208

zbMATH Keywords

large cardinalsdescriptive set theoryproper forcing

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Large cardinals (03E55) Determinacy principles (03E60)

Related Items (5)

Projective well-orderings of the reals ⋮ On a class of maximality principles ⋮ The stationarity of the collection of the locally regulars ⋮ Proper forcing and remarkable cardinals II ⋮ Mice with finitely many Woodin cardinals from optimal determinacy hypotheses

Cites Work

• Some descriptive set theory and core models
• \(\Sigma_3^1\) absoluteness and the second uniform indiscernible
• Large cardinals and definable counterexamples to the continuum hypothesis
• Proper forcing and L(ℝ)
• Proper Forcing and Remarkable Cardinals
• Core models with more Woodin cardinals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coding into 𝐾 by reasonable forcing