SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
From MaRDI portal
Publication:5021936
DOI10.1017/jsl.2021.4zbMath1485.03168OpenAlexW3128766521MaRDI QIDQ5021936
Dan Turetsky, Noam Greenberg, Rachael Alvir, Matthew Harrison-Trainor
Publication date: 17 January 2022
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/jsl.2021.4
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On the Borel classification of the isomorphism class of a countable model
- Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
- Computable structures and the hyperarithmetical hierarchy
- Scott sentences for certain groups
- Describing free groups
- Describing groups
- Effectively Existentially-Atomic Structures
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
- On optimal Scott sentences of finitely generated algebraic structures
- A robuster Scott rank
- An example concerning Scott heights
- Scott sentences and admissible sets
- Invariant sets in topology and logic
- Some new computable structures of high rank
- The effective Borel hierarchy
- Computable trees of Scott rank ω1CK, and computable approximation
- An interpolation theorem for denumerably long formulas
- Recursive Pseudo-Well-Orderings
This page was built for publication: SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
