THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS

DOI10.1017/jsl.2020.46zbMath1485.03104arXiv1810.11423OpenAlexW2898117887MaRDI QIDQ5855748

Dino Rossegger, Rachael Alvir

Publication date: 19 March 2021

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

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

zbMATH Keywords

linear ordersScott rankHausdorff rankscattered linear orders

Mathematics Subject Classification ID

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

Related Items (2)

New jump operators on equivalence relations ⋮ On bi-embeddable categoricity of algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Index sets and Scott sentences
• Pairs of recursive structures
• On the Borel classification of the isomorphism class of a countable model
• Computable structures and the hyperarithmetical hierarchy
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Turing Computability
• Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey
• COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
• A robuster Scott rank
• Index sets of computable structures
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Scott sentences and admissible sets
• Invariant sets in topology and logic
• Some new computable structures of high rank
• Complexity of Scott sentences
• Computable trees of Scott rank ω₁^CK, and computable approximation
• Recursive Pseudo-Well-Orderings
• Up to equimorphism, hyperarithmetic is recursive

This page was built for publication: THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS