Degree-invariant, analytic equivalence relations without perfectly many classes
From MaRDI portal
Publication:2832838
DOI10.1090/proc/13218zbMath1423.03175OpenAlexW2342028785MaRDI QIDQ2832838
Publication date: 14 November 2016
Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/proc/13218
Descriptive set theory (03E15) Other Turing degree structures (03D28) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Determinacy principles (03E60)
Related Items (2)
Cites Work
- Unnamed Item
- Countable admissible ordinals and hyperdegrees
- A computability theoretic equivalent to Vaught's conjecture
- A classification of jump operators
- Recursive well-orderings
- On the Equimorphism Types of Linear Orderings
- Counting the number of equivalence classes of Borel and coanalytic equivalence relations
- A reflection phenomenon in descriptive set theory
- Analytic determinacy and 0#
- ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE
- Ranked structures and arithmetic transfinite recursion
- Recursive Pseudo-Well-Orderings
This page was built for publication: Degree-invariant, analytic equivalence relations without perfectly many classes