Forcing in admissible sets

DOI10.1007/BF01978554MaRDI QIDQ1191174zbMATH OpenFDO

Authors Yuri L. Ershov

Publication date 27 September 1992

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01978554

zbMATH Keywords

admissible end-extensionadmissible ordinaladmissible setforcingurelements

Mathematics Subject Classification ID

Logic on admissible sets (03C70) Other aspects of forcing and Boolean-valued models (03E40)

Review text

An admissible set is constructed by forcing. Using this set, the author proves that a countable admissible set \(\mathbb{A}\) has no non-trivial admissible end-extension with the same urelements and ordinals iff \(\mathbb{A}=\text{HF}(X)\) for a finite \(X\).

Recommendations

• Inadmissible forcing
• scientific article; zbMATH DE number 4057500
• scientific article; zbMATH DE number 4057496
• New Computational Paradigms
• Forcing and antifoundation

Cites work

• An “admissible” generalization of a theorem on countable ∑11 sets of reals with applications
• scientific article; zbMATH DE number 4057496 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• THE INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

Cited in

(7)

• Admissibility spectra through \(\omega _ 1\)
• Inadmissible forcing
• Letter to the editors: Forcing in admissible sets
• On the inner constructivizability of admissible sets
• Provident sets and rudimentary set forcing
• Feedback computability on Cantor space
• Each family of subsets of the urelements generates an admissible set

This page was built for publication: Forcing in admissible sets

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