Degrees of categoricity vs. strong degrees of categoricity

DOI10.1007/S10469-016-9385-6zbMath1402.03066OpenAlexW2510730833MaRDI QIDQ2364297

M. M. Yamaleev, Nikolay Bazhenov, Iskander Sh. Kalimullin

Publication date: 18 July 2017

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-016-9385-6

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28) Categoricity and completeness of theories (03C35)

Related Items (11)

Degrees of autostability relative to strong constructivizations of graphs ⋮ Degrees of autostability for prime Boolean algebras ⋮ Every Δ20 degree is a strong degree of categoricity ⋮ Degrees of categoricity of trees and the isomorphism problem ⋮ Strong degrees of categoricity and weak density ⋮ DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION ⋮ Degrees of categoricity of rigid structures ⋮ Punctual categoricity relative to a computable oracle ⋮ Categoricity spectra of computable structures ⋮ The degree of decidable categoricity of a model with infinite solutions for complete formulas ⋮ Degrees of bi-embeddable categoricity of equivalence structures

Cites Work

• Degrees that are not degrees of categoricity
• Degrees of categoricity and the hyperarithmetic hierarchy
• Autostability spectra for Boolean algebras
• Degrees of categoricity of computable structures
• d-computable categoricity for algebraic fields
• Categoricity spectra for rigid structures

This page was built for publication: Degrees of categoricity vs. strong degrees of categoricity