The computable dimension of trees of infinite height

DOI10.2178/jsl/1107298513zbMath1098.03049OpenAlexW2084666877MaRDI QIDQ3370758

Unnamed Author

Publication date: 8 February 2006

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

Full work available at URL: https://doi.org/10.2178/jsl/1107298513

zbMATH Keywords

treecomputable dimensionautostabilitycomputable model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (10)

Computable isomorphisms for certain classes of infinite graphs ⋮ Computable Heyting algebras with distinguished atoms and coatoms ⋮ Computability-theoretic categoricity and Scott families ⋮ Effective categoricity of equivalence structures ⋮ Categoricity spectra of computable structures ⋮ Computable categoricity of trees of finite height ⋮ 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

Cites Work

• Recursive categoricity and recursive stability
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Computable isomorphisms, degree spectra of relations, and Scott families
• Categoricity in hyperarithmetical degrees

This page was built for publication: The computable dimension of trees of infinite height