Computable categoricity and the Ershov hierarchy

DOI10.1016/j.apal.2008.06.010zbMath1165.03012MaRDI QIDQ958489

Bakhadyr Khoussainov, Yue Yang, Frank Stephan

Publication date: 5 December 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2008.06.010

zbMATH Keywords

linear orders; graphs; categoricity; Ershov hierarchy; recursive ordinal

Mathematics Subject Classification ID

03D80: Applications of computability and recursion theory

03C57: Computable structure theory, computable model theory

03D45: Theory of numerations, effectively presented structures

03C35: Categoricity and completeness of theories