Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
From MaRDI portal
Publication:2970964
DOI10.1007/978-3-319-50062-1_18zbMATH Open1485.03115OpenAlexW2557796750MaRDI QIDQ2970964FDOQ2970964
Authors: Russell Miller 
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
Recommendations
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Generic copies of countable structures
- \(d\)-computable categoricity for algebraic fields
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of computable structures
- Title not available (Why is that?)
- Rice sequences of relations
- Degrees coded in jumps of orderings
- Degrees of Structures
- Notes on the Jump of a Structure
- A Jump Inversion Theorem for the Degree Spectra
- Theorie Der Numerierungen III
- Effective choice for relations and reducibilities in classes of constructive and positive models
- An autostable 1-decidable model without a computable Scott family of \(\exists\)-formulas
- Degrees of categoricity on a cone via \(\eta\)-systems
- A robuster Scott rank
- A description of autostable models
Cited In (4)
This page was built for publication: Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970964)
