Strong degrees of categoricity and weak density
From MaRDI portal
Publication:2211365
DOI10.1134/S1995080220090048zbMath1486.03062OpenAlexW3104018330MaRDI QIDQ2211365
M. M. Yamaleev, Iskander Sh. Kalimullin, Nikolay Bazhenov
Publication date: 11 November 2020
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080220090048
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Other Turing degree structures (03D28)
Related Items
Cites Work
- Unnamed Item
- Degrees that are not degrees of categoricity
- Weak density and cupping in the d-r.e. degrees
- Stability of recursive structures in arithmetical degrees
- Generic copies of countable structures
- Finite computable dimension and degrees of categoricity
- Categoricity in hyperarithmetical degrees
- Degrees of categoricity and the hyperarithmetic hierarchy
- Degrees of categoricity of rigid structures
- Degrees of categoricity vs. strong degrees of categoricity
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Degrees of autostability relative to strong constructivizations
- Degrees of categoricity of computable structures
- Effective procedures in field theory
- d-computable categoricity for algebraic fields
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Lowness for isomorphism and degrees of genericity
- DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION
- Coding in the automorphism group of a computably categorical structure
- Degrees of categoricity above limit ordinals
- Degrees that Are Low for Isomorphism
- Decompositions of decidable abelian groups
- Computable categoricity for algebraic fields with splitting algorithms
- CONSTRUCTIVE ALGEBRAS I
- Effective model theory vs. recursive model theory
- Categoricity spectra for rigid structures
- Effective categoricity of computable linear orderings
