Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
From MaRDI portal
Publication:2970964
DOI10.1007/978-3-319-50062-1_18zbMath1485.03115OpenAlexW2557796750MaRDI QIDQ2970964
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_18
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (3)
On decidable categoricity and almost prime models ⋮ Turing degrees of complete formulas of almost prime models ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generic copies of countable structures
- Effective choice for relations and reducibilities in classes of constructive and positive models
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of computable structures
- Rice sequences of relations
- A robuster Scott rank
- Notes on the Jump of a Structure
- A Jump Inversion Theorem for the Degree Spectra
- d-computable categoricity for algebraic fields
- Degrees coded in jumps of orderings
- Theorie Der Numerierungen III
- Degrees of Structures
- DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
This page was built for publication: Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
