Uncountable Admissibles I: Forcing

DOI10.2307/1999761zbMath0493.03025OpenAlexW4247232673MaRDI QIDQ3955346

Sy-David Friedman

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/1999761

zbMATH Keywords

constructibilityfine structureregular cardinal

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Other aspects of forcing and Boolean-valued models (03E40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (max. 100)

Strong coding ⋮ Admissibility spectra through \(\omega _ 1\) ⋮ Inadmissible forcing ⋮ Playing with admissibility spectra ⋮ Admissibility spectra and minimality ⋮ Countably decomposable admissible sets ⋮ Model theory for \(L_{\infty \omega _ 1}\) ⋮ Provident sets and rudimentary set forcing

This page was built for publication: Uncountable Admissibles I: Forcing