Scott sentence complexities of linear orderings

DOI10.1017/JSL.2024.59MaRDI QIDQ6858902zbMATH OpenFDO

Authors David S. González, Dino Rossegger

Publication date 12 February 2026

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

Full work available at URL https://doi.org/10.1017/JSL.2024.59

zbMATH Keywords

computable structuresinfinitary logiclinear orderingslinear ordersScott rankScott sentenceScott sentence complexitytotal orders

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Logic on admissible sets (03C70) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)

Cites work

• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• A Borel reductibility theory for classes of countable structures
• A construction for recursive linear orderings
• A robuster Scott rank
• Classes of structures with no intermediate isomorphism problems
• CODING IN GRAPHS AND LINEAR ORDERINGS
• Complexity of Scott sentences
• Computable Structure Theory
• Computable structures and the hyperarithmetical hierarchy
• Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
• Degrees of Structures
• Effective categoricity of computable linear orderings
• Enumerations in computable structure theory
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Recursive Pseudo-Well-Orderings
• Recursively Categorical Linear Orderings
• SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
• Some dichotomy theorems for isomorphism relations of countable models
• Spectra of high_n and non-low_n degrees
• THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
• The tree of tuples of a structure
• The 𝜔-Vaught’s conjecture

Cited in

(1)

• Generically computable linear orderings

This page was built for publication: Scott sentence complexities of linear orderings

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