Computability-theoretic categoricity and Scott families

DOI10.1016/j.apal.2019.01.003zbMath1441.03031OpenAlexW2911963073WikidataQ128476703 ScholiaQ128476703MaRDI QIDQ1740457

Valentina S. Harizanov, Daniel D. Turetsky, Ekaterina B. Fokina

Publication date: 30 April 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2019.01.003

zbMATH Keywords

categoricityScott familyTuring degreecomputable model theory

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

On decidable categoricity and almost prime models ⋮ Punctual categoricity relative to a computable oracle ⋮ Categoricity spectra of computable structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abelian \(p\)-groups and the halting problem
• Degrees that are not degrees of categoricity
• Effective categoricity of abelian \(p\)-groups
• Generic copies of countable structures
• Autostability of models and Abelian groups
• Autostability of models
• Enumerations of families of general recursive functions
• The quantity of nonautoequivalent constructivizations
• Degree spectra and computable dimensions in algebraic structures
• Categoricity in hyperarithmetical degrees
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Back and forth relations for reduced abelian \(p\)-groups
• Constructive Abelian \(p\)-groups
• Degrees of categoricity and the hyperarithmetic hierarchy
• Computability-theoretic properties of injection structures
• Effectively categorical abelian groups
• Effective categoricity of equivalence structures
• Enumerations in computable structure theory
• Degrees of categoricity of computable structures
• Effective procedures in field theory
• Recursive isomorphism types of recursive Boolean algebras
• The computable dimension of trees of infinite height
• Computable categoricity of trees of finite height
• Intrinsic bounds on complexity and definability at limit levels
• d-computable categoricity for algebraic fields
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Recursively Categorical Linear Orderings
• Computable categoricity versus relative computable categoricity
• Computable categoricity for algebraic fields with splitting algorithms
• Categoricity properties for computable algebraic fields
• Effective model theory vs. recursive model theory
• Categoricity spectra for rigid structures
• Effective categoricity of computable linear orderings

This page was built for publication: Computability-theoretic categoricity and Scott families