Computable categoricity versus relative computable categoricity
From MaRDI portal
Publication:4921488
DOI10.4064/fm221-2-2zbMath1320.03070OpenAlexW2089169908MaRDI QIDQ4921488
Steffen Lempp, Asher M. Kach, Rodney G. Downey, Daniel D. Turetsky
Publication date: 10 May 2013
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/fm221-2-2
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Related Items (max. 100)
Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations ⋮ The complexity of computable categoricity ⋮ Computability-theoretic categoricity and Scott families ⋮ Categoricity spectra of computable structures ⋮ Relativizing computable categoricity
This page was built for publication: Computable categoricity versus relative computable categoricity