Π11 relations and paths through
From MaRDI portal
Publication:5311742
DOI10.2178/jsl/1082418544zbMath1107.03051OpenAlexW2067940271MaRDI QIDQ5311742
Richard A. Shore, Valentina S. Harizanov, Sergei S. Goncharov, Julia F. Knight
Publication date: 29 August 2005
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/jsl/1082418544
Recursive ordinals and ordinal notations (03F15) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items (11)
Preserving categoricity and complexity of relations ⋮ Bi‐embeddability spectra and bases of spectra ⋮ STRUCTURAL HIGHNESS NOTIONS ⋮ The Complexity of Orbits of Computably Enumerable Sets ⋮ Scott sentences for certain groups ⋮ Effective categoricity of equivalence structures ⋮ On the orbits of computably enumerable sets ⋮ Categoricity of computable infinitary theories ⋮ Effective categoricity of abelian \(p\)-groups ⋮ COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$ ⋮ Classification from a Computable Viewpoint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Generic copies of countable structures
- Some effects of Ash-Nerode and other decidability conditions on degree spectra
- The quantity of nonautoequivalent constructivizations
- Computable isomorphisms, degree spectra of relations, and Scott families
- Possible degrees in recursive copies. II
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Possible degrees in recursive copies
- Countable retracing functions and \(\Pi_2^0\) predicates
- Solution to a Problem of Spector
- Models with compactness properties relative to an admissible language
- Forcing with tagged trees
- Intrinsically II Relations
- Intrinsically Hyperarithmetical Sets
This page was built for publication: Π11 relations and paths through
