Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-27T12:28:33.670Z Has data issue: false hasContentIssue false
  • English
  • Français

Computable embeddings and strongly minimal theories

Published online by Cambridge University Press:  12 March 2014

J. Chisholm ,
J. F. Knight  and
S. Miller
J. Chisholm
Affiliation:
Department of Mathematics, Western Illinois University, Macomb, IL 61455, USA, E-mail: [email protected]
J. F. Knight
Affiliation:
Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN 46556-5683. USA, E-mail: [email protected]
S. Miller
Affiliation:
Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN 46556-5683. USA, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Here we prove that if T and T′ are strongly minimal theories, where T′ satisfies a certain property related to triviality and T does not, and T′ is model complete, then there is no computable embedding of Mod(T) into Mod(T′). Using this, we answer a question from [4], showing that there is no computable embedding of VS into ZS, where VS is the class of infinite vector spaces over ℚ, and ZS is the class of models of Th(ℤ, S). Similarly, we show that there is no computable embedding of ACF into ZS, where ACF is the class of algebraically closed fields of characteristic 0.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 72 , Issue 3 , September 2007 , pp. 1031 - 1040
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Baldwin, J. T. and Lachlan, A. H., On strongly minimal sets, this Journal, vol. 36 (1971). pp. 79–96.Google Scholar
[2]Buechler, S., Essential stability theory. Perspectives in Mathematical Logic, Springer-Verlag, 1996.CrossRefGoogle Scholar
[3]Calvert, W.. Cummins, D.. Miller, S., and Knight, J. F., Comparing classes of finite structures, Algebra and Logic, vol. 43 (2004), pp. 365–373.CrossRefGoogle Scholar
[4]Calvert, W. and Knight, J. F., Classification from a computable point of view, The Bulletin of Symbolic Logic, vol. 12 (2006), pp. 191–218.CrossRefGoogle Scholar
[5]Camerlo, R. and Gao, S., The completeness of the isomorphism relation for countable Boolean algebras, Transactions of the American Mathematical Society, vol. 353 (2000), pp. 491–518.CrossRefGoogle Scholar
[6]Friedman, H. and Stanley, L.. A Borel reducibility theory for classes of countable structures, this Journal, vol. 54 (1989), pp. 894–914.Google Scholar
[7]Hjorth, G.. The isomorphism relation on countable torsion-free Abelian groups, Fundamenta Mathematicae, vol. 175 (2002), pp. 241–257.CrossRefGoogle Scholar
[8]Hjorth, G. and Kechris, A. S., Recent developments in the theory of Borel reducibility, Fundamenta Mathematicae, vol. 170 (2001). pp. 21–52.CrossRefGoogle Scholar
[9]Hjorth, G. and Thomas, S., The classification problem for p-local torsion-free Abelian groups of rank two, preprint.Google Scholar
[10]Knight, J. F., A result on the degree structures associated with effective embeddings, preprint.Google Scholar
[11]Knight, J. F.. Miller, S., and Boom, M. Vanden, Turing computable embeddings, this Journal, vol. 72 (2007), pp. 901–918.Google Scholar
[12]Thomas, S., On the complexity of the classification problem for torsion-free Abelian groups of finite rank, The Bulletin of Symbolic Logic, vol. 7 (2001). pp. 329–344.CrossRefGoogle Scholar