Abstract
For a computable structure M, the categoricity spectrum is the set of all Turing degrees capable of computing isomorphisms among arbitrary computable copies of M. If the spectrum has a least degree, this degree is called the degree of categoricity of 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.
| Original language | English |
|---|---|
| Pages (from-to) | 45-57 |
| Number of pages | 13 |
| Journal | Notre Dame Journal of Formal Logic |
| Volume | 57 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2016 |
Austrian Fields of Science 2012
- 101013 Mathematical logic
Keywords
- categoricity spectrum
- computable structure
- computably categorical
- degree of categoricity
- rigid structure
- Computable structure
- Degree of categoricity
- Categoricity spectrum
- Rigid structure
- Computably categorical
Fingerprint
Dive into the research topics of 'Categoricity spectra for rigid structures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver