Computable trees of Scott rank ω1CK, and computable approximation

DOI10.2178/jsl/1140641175zbMath1112.03039arXivmath/0508507OpenAlexW2081858636WikidataQ59199674 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

zbMATH Keywords

Scott rankcomputable treescomputable approximation

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items

Scott ranks of models of a theory, AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS, The countable admissible ordinal equivalence relation, Model Theoretic Complexity of Automatic Structures (Extended Abstract), ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE, STRUCTURAL HIGHNESS NOTIONS, Isomorphism relations on computable structures, Some new computable structures of high rank, COMPUTABLE ABELIAN GROUPS, 2008 Annual Meeting of the Association for Symbolic Logic, 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, The isomorphism problem on classes of automatic structures with transitive relations, THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS, SCOTT COMPLEXITY OF COUNTABLE STRUCTURES

Cites Work

• Pairs of recursive structures
• Ramified systems
• Computable structures and the hyperarithmetical hierarchy
• Scott sentences and admissible sets
• Unnamed Item
• Unnamed Item
• Unnamed Item