Computable embeddings and strongly minimal theories
From MaRDI portal
Publication:5422316
DOI10.2178/jsl/1191333854zbMath1127.03030OpenAlexW2128798017MaRDI QIDQ5422316
Sara Miller, J. S. Roy Chisholm, Julia F. Knight
Publication date: 17 October 2007
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jsl/1191333854
Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (3)
Turing computable embeddings, computable infinitary equivalence, and linear orders ⋮ Computable embeddings for pairs of linear orders ⋮ A note on computable embeddings for ordinals and their reverses
Cites Work
- Unnamed Item
- Recent developments in the theory of Borel reducibility
- On the Complexity of the Classification Problem for Torsion-Free Abelian Groups of Finite Rank
- A Borel reductibility theory for classes of countable structures
- Classification from a Computable Viewpoint
- The isomorphism relation on countable torsion free abelian groups
- Complexity of Categorical Theories with Computable Models
This page was built for publication: Computable embeddings and strongly minimal theories
