An effective minimal encoding of uncountable sets

DOI10.1134/S0037446611050107zbMATH Open1252.03113OpenAlexW1988752145MaRDI QIDQ665897

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) Inner models, including constructibility, ordinal definability, and core models (03E45) Ordinal and cardinal numbers (03E10)

Cites Work

• Long projective wellorderings
• On some classical problems of descriptive set theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Related Items (5)

Absoluteness of the Solovay set \(\Sigma \) ⋮ A Groszek‐Laver pair of undistinguishable ‐classes ⋮ Countable OD sets of reals belong to the ground model ⋮ A countable definable set containing no definable elements ⋮ Generalization of one construction by Solovay

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)