The Π 1 2 -Singleton Conjecture
From MaRDI portal
Publication:5202650
DOI10.2307/1990901zbMath0725.03030WikidataQ123274663 ScholiaQ123274663MaRDI QIDQ5202650
Publication date: 1990
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1990901
recursion theorem; Easton forcing; 0 sharp; Jensen coding; Silver indiscernibles; \(\Pi ^ 1_ 2\)-singleton
03E15: Descriptive set theory
03E45: Inner models, including constructibility, ordinal definability, and core models
03E55: Large cardinals
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Forcing closed unbounded subsets of \(\omega_2\), A definable \(E_0\) class containing no definable elements, A \(\Pi_ 2^ 1\) singleton incompatible with \(0^ \#\)