COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
From MaRDI portal
Publication:3094353
DOI10.1142/S0219061310000912zbMath1258.03039OpenAlexW2050882054MaRDI QIDQ3094353
Jessica Millar, Julia F. Knight
Publication date: 24 October 2011
Published in: Journal of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219061310000912
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (6)
Scott ranks of models of a theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE ⋮ Some new computable structures of high rank ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
Cites Work
- Pairs of recursive structures
- Generic copies of countable structures
- Computable structures and the hyperarithmetical hierarchy
- Categoricity in hyperarithmetical degrees
- Enumerations in computable structure theory
- An example concerning Scott heights
- Π11 relations and paths through
- Effect of impurities on superconducting transitions
- Intrinsically Hyperarithmetical Sets
- Effective model theory vs. recursive model theory
This page was built for publication: COMPUTABLE STRUCTURES OF RANK $\omega_{1}^{{\rm CK}}$
