Mathematical Logic Quarterly 49 (6):603 (2003)

We investigate the computational complexity the class of Γ-categorical computable structures. We show that hyperarithmetic categoricity is Π11-complete, while computable categoricity is Π04-hard
Keywords Computable structure  categorical structure  Scott family  hyperarithmetic categoricity
Categories (categorize this paper)
DOI 10.1002/malq.200310066
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 53,497
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Computably Isometric Spaces.Alexander G. Melnikov - 2013 - Journal of Symbolic Logic 78 (4):1055-1085.
Scott Sentences for Certain Groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.

View all 6 citations / Add more citations

Similar books and articles

Finite Computable Dimension Does Not Relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Effective Algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.
Prime Models of Finite Computable Dimension.Pavel Semukhin - 2009 - Journal of Symbolic Logic 74 (1):336-348.
Categoricity and Indefinite Extensibility.James Walmsley - 2002 - Proceedings of the Aristotelian Society 102 (3):217–235.


Added to PP index

Total views
6 ( #1,040,650 of 2,348,159 )

Recent downloads (6 months)
1 ( #510,741 of 2,348,159 )

How can I increase my downloads?


My notes