Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T19:27:00.768Z Has data issue: false hasContentIssue false

COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS I: COMPUTABLE CATEGORICITY

Published online by Cambridge University Press:  13 March 2015

NOAM GREENBERG
Affiliation:
DEPARTMENT OF MATHEMATICS, VICTORIA UNIVERSITY OF WELLINGTON, WELLINGTON, NEW ZEALANDE-mail: noam.greenberg@msor.vuw.ac.nzURL: http://homepages.mcs.vuw.ac.nz/∼greenberg/
ASHER M. KACH
Affiliation:
DEPARTMENT OF MATHEMATICS, UNIVERSITY OF CONNECTICUT-STORRS, STORRS, CT 06269-3009, USAE-mail: asher.kach@uconn.eduURL: http://www.math.uconn.edu/∼kach/
STEFFEN LEMPP
Affiliation:
DEPARTMENT OF MATHEMATICS, UNIVERSITY OF WISCONSIN, MADISON, WI 53706-1388, USAE-mail: lempp@math.wisc.eduURL: http://www.math.wisc.edu/∼lempp/
DANIEL D. TURETSKY
Affiliation:
KURT GÖDEL RESEARCH CENTER, UNIVERSITY OF VIENNA, VIENNA, AUSTRIAE-mail: turetsd4@univie.ac.atURL: http://tinyurl.com/dturetsky
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2015