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

Preview

PDF - Accepted Version Download (679kB) | Preview

• Author

Abstract

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:	https://www.journals.elsevier.com/advances-in-math...
Additional Information:	© 2014 Elsevier Inc.
Divisions:	LSE
Subjects:	Q Science > QA Mathematics
Date Deposited:	27 Feb 2017 15:12
Last Modified:	17 Jan 2024 06:48
URI:	http://eprints.lse.ac.uk/id/eprint/69570

Actions (login required)

View Item