On the non-enumerability of L

DOI10.1017/JSL.2016.34zbMATH Open1403.03075OpenAlexW2558966775MaRDI QIDQ2976338FDOQ2976338

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

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})\)

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)

Cites Work

• Descriptive set theory
• Title not available (Why is that?)
• Effective Mathematics of the Uncountable
• Title not available (Why is that?)
• 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)