A Turing degree d is the degree of categoricity of a computable structure S if d is the least degree capable of computing isomorphisms among arbitrary computable copies of S. A degree d is the strong degree of categoricity of S if d is the degree of categoricity of S, and there are computable copies A and B of S such that every isomorphism from A onto B computes d. In this paper, we build a c.e. degree d and a computable rigid structure Msuch that d is the degree of categoricity of M, but d is not the strong degree of categoricity of M. This solves the open problem of Fokina, Kalimullin, andMiller . For a computable structure S, we introduce the notion of the spectral dimension of S, which gives a quantitative characteristic of the degree of categoricity of S. We prove that for a nonzero natural number N, there is a computable rigid structureMsuch that 0 is the degree of categoricity ofM, and the spectral dimension ofMis equal to N.
Предметные области OECD FOS+WOS
- 6.03.UA ФИЛОСОФИЯ
- 1.01.QL ЛОГИКА