Some new computable structures of high rank

DOI10.1090/proc/13967zbMath1469.03122arXiv1606.00900OpenAlexW2964254961MaRDI QIDQ4636764

Matthew Harrison-Trainor, Gregory Igusa, Julia F. Knight

Publication date: 20 April 2018

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.00900

Mathematics Subject Classification ID

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

Related Items (4)

AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites Work

• Unnamed Item
• Unnamed Item
• Atomic models higher up
• Categoricity of computable infinitary theories
• Degree spectra and computable dimensions in algebraic structures
• Computability of Fraïssé limits
• COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
• An example concerning Scott heights
• Scott sentences and admissible sets
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Recursive Pseudo-Well-Orderings
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
• A family of countable homogeneous graphs

This page was built for publication: Some new computable structures of high rank