Degrees of categoricity of computable structures

Archive for Mathematical Logic 49 (1):51-67 (2010)
  Copy   BIBTEX

Abstract

Defining the degree of categoricity of a computable structure ${\mathcal{M}}$ to be the least degree d for which ${\mathcal{M}}$ is d-computably categorical, we investigate which Turing degrees can be realized as degrees of categoricity. We show that for all n, degrees d.c.e. in and above 0 (n) can be so realized, as can the degree 0 (ω)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 89,311

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Effective algebraicity.Rebecca M. Steiner - 2013 - Archive for Mathematical Logic 52 (1-2):91-112.
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
d-computable Categoricity for Algebraic Fields.Russell Miller - 2009 - Journal of Symbolic Logic 74 (4):1325 - 1351.
Degree spectra of intrinsically C.e. Relations.Denis R. Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.
On Turing degrees of points in computable topology.Iraj Kalantari & Larry Welch - 2008 - Mathematical Logic Quarterly 54 (5):470-482.
Spectra of Structures and Relations.Valentina S. Harizanov & Russel G. Miller - 2007 - Journal of Symbolic Logic 72 (1):324 - 348.

Analytics

Added to PP
2013-11-23

Downloads
66 (#218,735)

6 months
10 (#131,401)

Historical graph of downloads
How can I increase my downloads?

Author's Profile