SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
From MaRDI portal
Recommendations
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Computability in structures representing a Scott set
- Computability-Theoretic Complexity of Countable Structures
- Hanf number for Scott sentences of computable structures
- scientific article; zbMATH DE number 5960302
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
- Computability-theoretic categoricity and Scott families
- Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
- Complexity ranks of countable models
- Borel complexity and potential canonical Scott sentences
Cites work
- A robuster Scott rank
- An example concerning Scott heights
- An interpolation theorem for denumerably long formulas
- Computable structures and the hyperarithmetical hierarchy
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- Computable trees of Scott rank ω1CK, and computable approximation
- Describing free groups
- Describing groups
- Effectively existentially-atomic structures
- scientific article; zbMATH DE number 3609660 (Why is no real title available?)
- scientific article; zbMATH DE number 3266609 (Why is no real title available?)
- Invariant sets in topology and logic
- On optimal Scott sentences of finitely generated algebraic structures
- 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
- Recursive Pseudo-Well-Orderings
- Scott sentences and admissible sets
- Scott sentences for certain groups
- Some new computable structures of high rank
- The effective Borel hierarchy
Cited in
(27)- Scott ranks of models of a theory
- Scott sentences for certain groups
- Bounds on Scott rank for various nonelementary classes
- Computable Scott sentences for quasi-Hopfian finitely presented structures
- Exponentiation of Scott formal topologies
- Describing groups
- Effectively existentially-atomic structures
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- On optimal Scott sentences of finitely generated algebraic structures
- A robuster Scott rank
- Kleene, Rabin, and Scott Are Available
- scientific article; zbMATH DE number 4033714 (Why is no real title available?)
- Index sets and Scott sentences
- scientific article; zbMATH DE number 1222106 (Why is no real title available?)
- Measuring complexities of classes of structures
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Strange structures from computable model theory
- Bounds on continuous Scott rank
- Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
- Scott sentence complexities of linear orderings
- Subrecursive hierarchies on Scott domains
- Defining algorithmically presented structures in first order logic
- Scott analysis, linear orders, and almost periodic functions
- The structural complexity of models of arithmetic
- Scott complexity of reduced abelian p-groups
- Optimal syntactic definitions of back-and-forth types
This page was built for publication: SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021936)
