Computable structures of rank _1CK
From MaRDI portal
Publication:3094353
Recommendations
Cites work
- An example concerning Scott heights
- Categoricity in hyperarithmetical degrees
- Computable structures and the hyperarithmetical hierarchy
- Effect of impurities on superconducting transitions
- Effective model theory vs. recursive model theory
- Enumerations in computable structure theory
- Generic copies of countable structures
- Intrinsically Hyperarithmetical Sets
- Pairs of recursive structures
- Π11 relations and paths through
Cited in
(16)- Categoricity of computable infinitary theories
- Scott ranks of models of a theory
- On the Cantor-Bendixson rank of a set that is searchable in Gödel's T
- Scott rank of automatic partial orders
- scientific article; zbMATH DE number 6536307 (Why is no real title available?)
- Some new computable structures of high rank
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Strange structures from computable model theory
- Assigning an isomorphism type to a hyperdegree
- Computable structures of Scott rank \(\omega_1^{CK}\) in familiar classes
- Index sets for classes of high rank structures
- Computable trees of Scott rank ω1CK, and computable approximation
- THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS
- Defining algorithmically presented structures in first order logic
- Atomic models higher up
This page was built for publication: Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094353)