Categoricity Spectra for Rigid Structures

Notre Dame Journal of Formal Logic 57 (1):45-57 (2016)
  Copy   BIBTEX

Abstract

For a computable structure $\mathcal {M}$, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of $\mathcal {M}$. If the spectrum has a least degree, this degree is called the degree of categoricity of $\mathcal {M}$. In this paper we investigate spectra of categoricity for computable rigid structures. In particular, we give examples of rigid structures without degrees of categoricity.

Links

PhilArchive



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

External links

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

Through your library

Analytics

Added to PP
2015-10-30

Downloads
36 (#442,230)

6 months
16 (#218,342)

Historical graph of downloads
How can I increase my downloads?

Author's Profile