The Π 1 2 -Singleton Conjecture

DOI10.2307/1990901zbMath0725.03030OpenAlexW2083783279WikidataQ123274663 ScholiaQ123274663MaRDI QIDQ5202650

Sy-David Friedman

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

zbMATH Keywords

recursion theoremEaston forcing0 sharpJensen codingSilver indiscernibles\(\Pi ^ 1_ 2\)-singleton

Mathematics Subject Classification ID

Descriptive set theory (03E15) Inner models, including constructibility, ordinal definability, and core models (03E45) Large cardinals (03E55) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

A definable \(E_0\) class containing no definable elements ⋮ Forcing closed unbounded subsets of \(\omega_2\) ⋮ Projective Measure Without Projective Baire ⋮ A \(\Pi_ 2^ 1\) singleton incompatible with \(0^ \#\)

This page was built for publication: The Π 1 2 -Singleton Conjecture