Computable categoricity of trees of finite height

DOI10.2178/JSL/1107298515zbMath1104.03026OpenAlexW2027559165MaRDI QIDQ3370760

Unnamed Author, Steffen Lempp, Charles F. D. McCoy, D. Reed Solomon

Publication date: 8 February 2006

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.729

zbMATH Keywords

treecomputable dimensioncomputable modelconstructive modelcomputable categoricityautoequivalent constructivizations

Mathematics Subject Classification ID

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

Related Items (18)

Computable dimension for ordered fields ⋮ A robuster Scott rank ⋮ On limitwise monotonicity and maximal block functions ⋮ Computable isomorphisms for certain classes of infinite graphs ⋮ Degrees of categoricity of trees and the isomorphism problem ⋮ Some Questions in Computable Mathematics ⋮ The complexity of computable categoricity ⋮ A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS ⋮ Computability-theoretic categoricity and Scott families ⋮ 0″-Categorical Completely Decomposable Torsion-Free Abelian Groups ⋮ Effective categoricity of equivalence structures ⋮ Categoricity spectra of computable structures ⋮ Primitively recursive categoricity for unars and equivalence structures ⋮ Effective categoricity of abelian \(p\)-groups ⋮ d-computable categoricity for algebraic fields ⋮ Computable categoricity for algebraic fields with splitting algorithms ⋮ Categoricity properties for computable algebraic fields ⋮ Abelian \(p\)-groups and autostability relative to an oracle

Cites Work

• Unnamed Item
• Recursive categoricity and recursive stability
• Generic copies of countable structures
• Problem of the number of non-self-equivalent constructivizations
• Strong and weak constructivization and computable families
• Computable isomorphisms, degree spectra of relations, and Scott families
• Degree spectra and computable dimensions in algebraic structures
• Categoricity in hyperarithmetical degrees
• Nilpotent groups of finite algorithmic dimension
• The computable dimension of ordered abelian groups
• The computable dimension of trees of infinite height
• Effective content of field theory
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• On the complexity of categoricity in computable structures

This page was built for publication: Computable categoricity of trees of finite height