Degrees of categoricity of computable structures
From MaRDI portal
Publication:2655143
DOI10.1007/s00153-009-0160-4zbMath1184.03026MaRDI QIDQ2655143
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russell G. Miller
Publication date: 22 January 2010
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-009-0160-4
03C57: Computable structure theory, computable model theory
03D28: Other Turing degree structures
03C35: Categoricity and completeness of theories
Related Items
DEGREES OF CATEGORICITY AND SPECTRAL DIMENSION, A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS, 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 and lowness for isometric isomorphism, Decompositions of decidable abelian groups, Computable categoricity for algebraic fields with splitting algorithms, DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS, 2-Computably Enumerable Degrees of Categoricity for Boolean Algebras with Distinguished Automorphisms, The theory of projective planes is complete with respect to degree spectra and effective dimensions, Effective categoricity of computable linear orderings, Computing on the Banach space C [ 0 , 1 ], Degrees that are not degrees of categoricity, Computable categoricity of the Boolean algebra \(\mathfrak{B}(\omega )\) with a distinguished automorphism, Categoricity spectra for polymodal algebras, Algebraic structures computable without delay, On categoricity spectra for locally finite graphs, Index sets for \(n\)-decidable structures categorical relative to \(m\)-decidable presentations, Finite computable dimension and degrees of categoricity, Degrees of autostability relative to strong constructivizations of graphs, Degrees of autostability for prime Boolean algebras, Computable bi-embeddable categoricity, Computability-theoretic categoricity and Scott families, Effective algebraicity, Degrees of categoricity and the hyperarithmetic hierarchy, Simple structures with complex symmetry, 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, Punctual categoricity spectra of computably categorical structures, On bi-embeddable categoricity of algebraic structures, Calculating the mind change complexity of learning algebraic structures, Computable procedures for fields, On decidable categoricity and almost prime models, Strong degrees of categoricity and weak density, HKSS-completeness of modal algebras, Turing degrees of complete formulas of almost prime models, Analytic computable structure theory and \(L^p\)-spaces. II, Categorical linearly ordered structures, Degrees of bi-embeddable categoricity of equivalence structures, Computability-theoretic properties of injection structures, Autostability spectra for Boolean algebras, Degrees of autostability relative to strong constructivizations for Boolean algebras, Degrees of categoricity vs. strong degrees of categoricity, Degrees of autostability for linear orders and linearly ordered abelian groups, Effectively categorical abelian groups, Effective categoricity for distributive lattices and Heyting algebras, Degrees of categoricity for superatomic Boolean algebras, Degrees of autostability relative to strong constructivizations, Degrees of relative computable categoricity, 2011 North American Annual Meeting of the Association for Symbolic Logic, Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey, 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Problem of the number of non-self-equivalent constructivizations
- Degree spectra and computable dimensions in algebraic structures
- Enumerations in computable structure theory
- Effective procedures in field theory
- Non Σn axiomatizable almost strongly minimal theories
- d-computable categoricity for algebraic fields
- Computably categorical structures and expansions by constants
- Degrees of Structures
- Number theoretic concepts and recursive well-orderings
- Complexity of Categorical Theories with Computable Models
