COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY
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 characterize which of these linear orders are computably categorical.