Some new computable structures of high rank

DOI10.1090/PROC/13967zbMATH Open1469.03122arXiv1606.00900OpenAlexW2964254961MaRDI QIDQ4636764FDOQ4636764

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

Publication date: 20 April 2018

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

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.

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

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

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)