Degrees of categoricity of computable structures

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


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 (ω)



    Upload a copy of this work     Papers currently archived: 94,452

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


Added to PP

91 (#186,115)

6 months
25 (#143,424)

Historical graph of downloads
How can I increase my downloads?

Author's Profile