COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA. (13th March 2015)

• Record Type: Journal Article
• Authors: GREENBERG, NOAM; KACH, ASHER M.; LEMPP, STEFFEN; TURETSKY, DANIEL D.
• Is Part Of: Journal of symbolic logic. Volume 80:Number 1(2015)
• Page Start: 145
• Page End: 178
• Publication Date: 2015-03-13
• Subjects: Primary: 03D60, -- secondary: 03C57; uncountable linear orders, -- computability, -- computable categoricity; Logic, Symbolic and mathematical -- Periodicals; 511.3
• DOI: 10.1017/jsl.2014.69
• Languages: English
• ISSNs: 0022-4812

Abstract

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.