Some new computable structures of high rank

DOI10.1090/PROC/13967MaRDI QIDQ4636764zbMATH OpenOpenAlexFDO

Authors Matthew Harrison-Trainor, Gregory Igusa, J. 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)

Abstract: We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank $omeg{a}_1^{CK}$, the computable infinitary theory is $alep{h}_0$-categorical. Millar and Sacks asked whether this was always the case. We answer this question by constructing an example whose computable infinitary theory has non-isomorphic countable models. The standard known computable structures of Scott rank $omeg{a}_1^{CK}+1$ have infinite indiscernible sequences. We give two constructions with no indiscernible ordered triple.

Recommendations

• Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
• scientific article; zbMATH DE number 493148
• Degree spectra and computable dimensions in algebraic structures
• Computable embeddability for algebraic structures
• Some results on \(\mathbb{R}\)-computable structures
• scientific article; zbMATH DE number 5960302
• Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
• Index sets for classes of high rank structures
• scientific article; zbMATH DE number 3848613
• Computable structures and the hyperarithmetical hierarchy

Cites work

• scientific article; zbMATH DE number 5960302 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• A family of countable homogeneous graphs
• An example concerning Scott heights
• Atomic models higher up
• Categoricity of computable infinitary theories
• Computability of Fraïssé limits
• Computable functors and effective interpretability
• Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Degree spectra and computable dimensions in algebraic structures
• Recursive Pseudo-Well-Orderings
• Scott sentences and admissible sets

Cited in

(11)

• Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
• Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Atomic models higher up
• A robuster Scott rank
• Index sets for classes of high rank structures
• Assigning an isomorphism type to a hyperdegree
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• Categoricity of computable infinitary theories
• An introduction to the Scott complexity of countable structures and a survey of recent results
• Strange structures from computable model theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636764)