Classification from a Computable Viewpoint

DOI10.2178/bsl/1146620059zbMath1123.03024DBLPjournals/bsl/CalvertK06arXiv0803.3293OpenAlexW2115811029WikidataQ59199670 ScholiaQ59199670MaRDI QIDQ3430937

Wesley Calvert, Julia F. Knight

Publication date: 5 April 2007

Published in: Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0803.3293

zbMATH Keywords

surveycomputable structuresScott rankBorel embeddingBorel isomorphism relation

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Model theory of denumerable and separable structures (03C15)

Related Items (15)

Scott ranks of models of a theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Agreement reducibility ⋮ Computable numberings of the class of Boolean algebras with distinguished endomorphisms ⋮ The complexity of decomposability of computable rings ⋮ On two types of concept lattices in the theory of numberings ⋮ Classifications of computable structures ⋮ FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS ⋮ The isomorphism problem for torsion-free abelian groups is analytic complete ⋮ Computable embeddings and strongly minimal theories ⋮ Computable transformations of structures ⋮ Categoricity spectra of computable structures ⋮ Tree-Automatic Well-Founded Trees ⋮ On the degree structure of equivalence relations under computable reducibility ⋮ The isomorphism problem on classes of automatic structures with transitive relations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Composites of algebraically closed fields
• A proof of Vaught's conjecture for \(\omega\)-stable theories
• Autostability of models
• On the Borel classification of the isomorphism class of a countable model
• Theories of linear order
• Computable structures and the hyperarithmetical hierarchy
• Back and forth relations for reduced abelian \(p\)-groups
• The number of non-isomorphic models of an unstable first-order theory
• Recent developments in the theory of Borel reducibility
• A Borel reductibility theory for classes of countable structures
• The isomorphism problem for computable Abelian _p-groups of bounded length
• What is a Structure Theory?
• An example concerning Scott heights
• Scott sentences and admissible sets
• Models with compactness properties relative to an admissible language
• The isomorphism relation on countable torsion free abelian groups
• Π₁¹ relations and paths through
• Complexity of Categorical Theories with Computable Models
• The degrees of bi‐immune sets
• The number of countable models
• Infinitary logic and admissible sets
• On strongly minimal sets

This page was built for publication: Classification from a Computable Viewpoint