COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA
Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky · Journal of Symbolic Logic · 2015
Abstract We study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we study degree spectra and the successor relation.