Algebraicity and implicit definability in set theory
From MaRDI portal
Publication:306841
DOI10.1215/00294527-3542326zbMath1436.03264arXiv1305.5953OpenAlexW1632634803MaRDI QIDQ306841
Cole Leahy, Joel David Hamkins
Publication date: 1 September 2016
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5953
Inner models, including constructibility, ordinal definability, and core models (03E45) Set-theoretic model theory (03C55) Other notions of set-theoretic definability (03E47)
Related Items (7)
On Russell typicality in set theory ⋮ On the ‘definability of definable’ problem of Alfred Tarski, Part II ⋮ Typicality à la Russell in set theory ⋮ Recognizable sets and Woodin cardinals: computation beyond the constructible universe ⋮ Ehrenfeucht's lemma in set theory ⋮ THE IMPLICITLY CONSTRUCTIBLE UNIVERSE ⋮ THE EXACT STRENGTH OF THE CLASS FORCING THEOREM
Cites Work
This page was built for publication: Algebraicity and implicit definability in set theory