Coding into 𝐾 by reasonable forcing

DOI10.1090/S0002-9947-00-02636-2MaRDI QIDQ4517449zbMATH OpenOpenAlexFDO

Authors Ralf 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

descriptive set theorylarge cardinalsproper forcing

Mathematics Subject Classification ID

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

Abstract: Assuming that there is no inner model with a strong cardinal, the following is shown: any subset of omega_1 can be made Delta^1_3 (in the codes) by a reasonable set-forcing; there is a reasonable set-generic extension with a Delta^1_3 well-ordering of its reals; 2-step Sigma^1_4 absoluteness fails w.r.t. set-sized reasonable forcings.

Recommendations

• Strong coding
• Coding over a measurable cardinal
• Coding that preserves Ramseyness
• scientific article; zbMATH DE number 994189
• Coding by club-sequences

Cites work

• _3¹ absoluteness and the second uniform indiscernible
• Core models with more Woodin cardinals
• scientific article; zbMATH DE number 4047708 (Why is no real title available?)
• scientific article; zbMATH DE number 3652325 (Why is no real title available?)
• scientific article; zbMATH DE number 3733900 (Why is no real title available?)
• scientific article; zbMATH DE number 218627 (Why is no real title available?)
• scientific article; zbMATH DE number 967740 (Why is no real title available?)
• Large cardinals and definable counterexamples to the continuum hypothesis
• Proper forcing and \(L(\mathbb{R})\)
• Proper Forcing and Remarkable Cardinals
• Some descriptive set theory and core models

Cited in

(17)

• Strong coding
• On a class of maximality principles
• Coding lemmata in \(L(V_{\lambda+1})\)
• Codings and strongly inaccessible cardinals
• Coding into Ramsey sets
• Coding by club-sequences
• Proper forcing and remarkable cardinals. II
• Coding into HOD via normal measures with some applications
• GENERICITY AND LARGE CARDINALS
• Coding that preserves Ramseyness
• scientific article; zbMATH DE number 218627 (Why is no real title available?)
• The stationarity of the collection of the locally regulars
• Coding over core models
• Mice with finitely many Woodin cardinals from optimal determinacy hypotheses
• Coding with canonical functions
• Coding into inner models at the level of strong cardinals
• Projective well-orderings of the reals

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517449)