Computable trees of Scott rank ω1CK, and computable approximation
From MaRDI portal
Publication:5477636
DOI10.2178/jsl/1140641175zbMath1112.03039arXivmath/0508507WikidataQ59199674 ScholiaQ59199674MaRDI QIDQ5477636
Jessica Millar, Wesley Calvert, Julia F. Knight
Publication date: 5 July 2006
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0508507
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
Related Items
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, ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE, Isomorphism relations on computable structures, THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS, STRUCTURAL HIGHNESS NOTIONS, Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007, Categoricity of computable infinitary theories, Scott ranks of models of a theory, The countable admissible ordinal equivalence relation, COMPUTABLE ABELIAN GROUPS, The isomorphism problem on classes of automatic structures with transitive relations, Model Theoretic Complexity of Automatic Structures (Extended Abstract), 2008 Annual Meeting of the Association for Symbolic Logic
Cites Work
