Library Header Image
LSE Research Online LSE Library Services

The complexity of computable categoricity

Downey, Rodney G., Kach, Asher M., Lempp, Steffen, Lewis-Pye, Andrew, Montalbán, Antonio and Turetsky, Daniel D. (2015) The complexity of computable categoricity. Advances in Mathematics, 268. pp. 423-466. ISSN 0001-8708

PDF - Accepted Version
Download (679kB) | Preview

Identification Number: 10.1016/j.aim.2014.09.022


We show that the index set complexity of the computably categorical structures is View the MathML source-complete, demonstrating that computable categoricity has no simple syntactic characterization. As a consequence of our proof, we exhibit, for every computable ordinal α , a computable structure that is computably categorical but not relatively View the MathML source-categorical.

Item Type: Article
Official URL:
Additional Information: © 2014 Elsevier Inc.
Divisions: LSE
Subjects: Q Science > QA Mathematics
Date Deposited: 27 Feb 2017 15:12
Last Modified: 16 May 2024 02:10

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics