Scott ranks of models of a theory
From MaRDI portal
Publication:1644961
DOI10.1016/j.aim.2018.03.012zbMath1469.03103arXiv1510.07759OpenAlexW2964341356MaRDI QIDQ1644961
Publication date: 22 June 2018
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.07759
Other infinitary logic (03C75) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Determinacy principles (03E60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on weak scattering
- Complexity ranks of countable models
- Countable admissible ordinals and hyperdegrees
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- A computability theoretic equivalent to Vaught's conjecture
- Degrees of categoricity and the hyperarithmetic hierarchy
- Bounds on Scott rank for various nonelementary classes
- Computability of Fraïssé limits
- COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
- Classification from a Computable Viewpoint
- A robuster Scott rank
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- An example concerning Scott heights
- Scott sentences and admissible sets
- 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 ranks of models of a theory
