Degrees that are not degrees of categoricity
From MaRDI portal
Publication:306834
DOI10.1215/00294527-3496154zbMath1436.03229arXiv1210.4220MaRDI QIDQ306834
Bernard A. Anderson, Barbara F. Csima
Publication date: 1 September 2016
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.4220
computable structure; computably categorical; degree of categoricity; category spectrum; CatSpec; strong degree of categoricity
03D30: Other degrees and reducibilities in computability and recursion theory
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION, Coding in the automorphism group of a computably categorical structure, Degrees of bi-embeddable categoricity, Every Δ20 degree is a strong degree of categoricity, Degrees of categoricity of trees and the isomorphism problem, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, Finite computable dimension and degrees of categoricity, Computability-theoretic categoricity and Scott families, Degrees of categoricity of rigid structures, Categoricity spectra of computable structures, On decidable categoricity and almost prime models, Strong degrees of categoricity and weak density, Turing degrees of complete formulas of almost prime models, Analytic computable structure theory and \(L^p\)-spaces. II, Degrees of categoricity vs. strong degrees of categoricity, Degrees of autostability for linear orders and linearly ordered abelian groups, Strength and Weakness in Computable Structure Theory, A Note on Effective Categoricity for Linear Orderings, Prime Model with No Degree of Autostability Relative to Strong Constructivizations
Cites Work
