ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE
From MaRDI portal
Publication:5107233
DOI10.1017/jsl.2019.81zbMath1477.03144OpenAlexW2995967932WikidataQ126530976 ScholiaQ126530976MaRDI QIDQ5107233
Publication date: 17 April 2020
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2019.81
Descriptive set theory (03E15) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (2)
AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ A theorem about Σ¹₁ equivalence relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strange structures from computable model theory
- Descriptive set theory
- Computable structures and the hyperarithmetical hierarchy
- On disjoint Borel uniformizations
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
- Classes of Ulm type and coding rank-homogeneous trees in other structures
- A robuster Scott rank
- A computable ℵ0-categorical structure whose theory computes true arithmetic
- An example concerning Scott heights
- Scott sentences and admissible sets
- The Theory of Countable Analytical Sets
- Proof of a Conjecture of Friedman
- Analytic determinacy and 0#
- Forcing with tagged trees
- An analytic equivalence relation not arising from a Polish group action
- Polish Group Actions and the Vaught Conjecture
- COMPUTABLE POLISH GROUP ACTIONS
- A comparison of concepts from computable analysis and effective descriptive set theory
- Some new computable structures of high rank
- Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
- Computable trees of Scott rank ω1CK, and computable approximation
- The Forcing Method and the Upper Semilattice of Hyperdegrees
This page was built for publication: ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE
