Translator Disclaimer
2016 Categoricity Spectra for Rigid Structures
Ekaterina Fokina, Andrey Frolov, Iskander Kalimullin
Notre Dame J. Formal Logic 57(1): 45-57 (2016). DOI: 10.1215/00294527-3322017

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.

Citation

Download Citation

Ekaterina Fokina. Andrey Frolov. Iskander Kalimullin. "Categoricity Spectra for Rigid Structures." Notre Dame J. Formal Logic 57 (1) 45 - 57, 2016. https://doi.org/10.1215/00294527-3322017

Information

Received: 14 February 2013; Accepted: 26 August 2013; Published: 2016
First available in Project Euclid: 30 October 2015

zbMATH: 1359.03030
MathSciNet: MR3447724
Digital Object Identifier: 10.1215/00294527-3322017

Subjects:
Primary: 03C57, 03D45

Rights: Copyright © 2016 University of Notre Dame

JOURNAL ARTICLE
13 PAGES


SHARE
Vol.57 • No. 1 • 2016
Back to Top