On the non-enumerability of L

DOI10.1017/JSL.2016.34MaRDI QIDQ2976338zbMATH OpenOpenAlexFDO

Authors Gerald E. Sacks

Publication date 28 April 2017

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/jsl.2016.34

zbMATH Keywords

absolutenessE-recursion

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Consistency and independence results (03E35) Higher-type and set recursion theory (03D65) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• The limits of E-recursive enumerability
• Reflection and forcing in E-recursion theory
• scientific article; zbMATH DE number 3916251
• Inadmissible forcing
• Proper forcing and \(L(\mathbb{R})\)

Cites work

• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3499732 (Why is no real title available?)
• Descriptive set theory
• Effective Mathematics of the Uncountable
• Uncomplemented C(X)-Subalgebras of C(X)

Cited in

(1)

• IN MEMORIAM: GERALD E. SACKS, 1933–2019

This page was built for publication: On the non-enumerability of \(L\)

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