An effective minimal encoding of uncountable sets

DOI10.1134/S0037446611050107MaRDI QIDQ665897zbMATH OpenOpenAlexFDO

Authors Vladimir Kanovei, Vassily Lyubetsky

Publication date 7 March 2012

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0037446611050107

zbMATH Keywords

forcingminimal encodingrelatively constructible set

Mathematics Subject Classification ID

Descriptive set theory (03E15) Consistency and independence results (03E35) Ordinal and cardinal numbers (03E10) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• On coding uncountable sets by reals
• Minimal coding
• scientific article; zbMATH DE number 3920534
• Minimal model of \(\aleph ^ L_ 1\) is countable and definable reals
• Countable OD sets of reals belong to the ground model

Cites work

• scientific article; zbMATH DE number 3733900 (Why is no real title available?)
• scientific article; zbMATH DE number 3351572 (Why is no real title available?)
• scientific article; zbMATH DE number 3387344 (Why is no real title available?)
• Long projective wellorderings
• On some classical problems of descriptive set theory

Cited in

(9)

• Generalization of one construction by Solovay
• A Groszek-Laver pair of undistinguishable \(\mathsf{E}_0\)-classes
• Countable OD sets of reals belong to the ground model
• scientific article; zbMATH DE number 5521857 (Why is no real title available?)
• On coding uncountable sets by reals
• scientific article; zbMATH DE number 3920534 (Why is no real title available?)
• Absoluteness of the Solovay set \(\Sigma \)
• A countable definable set containing no definable elements
• Minimal model of \(\aleph ^ L_ 1\) is countable and definable reals

This page was built for publication: An effective minimal encoding of uncountable sets

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