Skip to main content Accessibility help
×
Home

d-computable categoricity for algebraic fields

  • Russell Miller (a1) (a2)

Abstract

We use the Low Basis Theorem of Jockusch and Soare to show that all computable algebraic fields are d-computably categorical for a particular Turing degree d with d′ = 0″, but that not all such fields are 0′-computably categorical. We also prove related results about algebraic fields with splitting algorithms, and fields of finite transcendence degree over ℚ.

Copyright

References

Hide All
[1]Ash, C.J., Knight, J.F., Manasse, M.S., and Slaman, T.A., Generic copies of countable structures, Annals of Pure and Applied Logic, vol. 42 (1989), pp. 195205.
[2]Calvert, W., Harizanov, V., and Shlapentokh, A., Turing degrees of the isomorphism types of algebraic objects, Journal of London Mathematical Society, vol. 73 (2007), pp. 273286.
[3]Cenzer, D., Π10-classes in recursion theory, Handbook of computability theory (Griffor, E.R., editor). Elsevier, Amsterdam, 1999, pp. 3785.
[4]Downey, R.G. and Jockusch, C.G. Jr., Every low Boolean algebra is isomorphic to a recursive one. Proceedings of the American Mathematical Society, vol. 122, 1994, pp. 871880.
[5]Downey, R.G., Hirschfeldt, D.R., and Khoussainov, B., Uniformity in computable structure theory, Algebra and Logic, vol. 42 (2003), pp. 318332.
[6]Edwards, H.M., Galois theory, Springer-Verlag, New York, 1984.
[7]Ershov, Y.L. and Goncharov, S.S., Constructive fields, Constructive models, Kluwer Academic/Plenum Press, New York, 2000, Section 2.5.
[8]Ershov, Yu.L., Theorie der Numerierungen, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 23 (1977), pp. 289371.
[9]Fokina, E., Kalimullin, I., and Miller, R.G., Degrees of categoricity of computable structures, to appear.
[10]Fried, M.D. and Jarden, M., Field arithmetic, Springer-Verlag, Berlin, 1986.
[11]Frohlich, A. and Shepherdson, J.C., Effective procedures in field theory. The Philosophical Transactions of the Royal Society, Series A, vol. 248 (1956), no. 950, pp. 407432.
[12]Goncharov, S.S., Autostability and computable families of constructivizations, Algebra and Logic, vol. 14 (1975), pp. 647680, (Russian), 392–409 (English translation).
[13]Goncharov, S.S., Nonequivalent constructivizations, Proc. Math. Inst. Sib. Branch Acad. Sci., Nauka, Novosibirsk, 1982.
[14]Goncharov, S.S., Autostable models and algorithmic dimensions, Handbook of recursive mathematics, vol. 1, Elsevier, Amsterdam, 1998, pp. 261287.
[15]Goncharov, S.S. and Dzgoev, V.D., Autostability of models, Algebra and Logic, vol. 19 (1980), pp. 4558, (Russian), 28–37 (English translation).
[16]Goncharov, S.S., Lempp, S., and Solomon, R.. The computable dimension of ordered abelian groups, Advances in Mathematics, vol. 175 (2003), no. 1, pp. 102143.
[17]Hirschfeldt, D.R., Khoussainov, B., Shore, R.A., and Slinko, A.M., Degree spectra and computable dimensions in algebraic structures, Annals of Pure and Applied Logic, vol. 115 (2002), pp. 71113.
[18]Jacobson, N., Basic algebra I, W.H. Freeman & Co., New York, 1985.
[19]Jockusch, C.G. and Soare, R.I., Π10-classes and degrees of theories, Transactions of the American Mathematical Society, vol. 173 (1972), pp. 3356.
[20]Jockusch, C.G., Degrees of orderings not isomorphic to recursive linear orderings, Annals of Pure and Applied Logic, vol. 52 (1991), pp. 3964.
[21]Khoussainov, B. and Shore, R.A., Effective model theory: The number of models and their complexity, Models and computability: Invited papers from Logic Colloquium '97 (Cooper, S.B. and Truss, J.K., editors), LMSLNS, vol. 259, Cambridge University Press, Cambridge, 1999, pp. 193240.
[22]Kogabaev, N., Kudinov, O., and Miller, R.G., The computable dimension of I-trees of infinite height, Algebra and Logic, vol. 43 (2004), no. 6, pp. 393407.
[23]Kronecker, L., Grundzüge einer arithmetischen Theorie der algebraischen Größen, Journal für die reine undangewandte Mathematik, vol. 92 (1882), pp. 1122.
[24]Lempp, S., Mccoy, C., Miller, R.G., and Solomon, R., Computable categoricity of trees of finite height, this Journal, vol. 70 (2005), pp. 151215.
[25]Miller, R.G., The δ20-spectrum of a linear order, this Journal, vol. 66 (2001), pp. 470486.
[26]Miller, R.G., The computable dimension of trees of infinite height, this Journal, vol. 70 (2005), pp. 111141.
[27]Miller, R.G. and Schoutens, H., Computably categorical fields via Fermat's Last Theorem, to appear.
[28]Metakides, G.Nerode, A., Effective content of field theory, Annals of Mathematical Logic, vol. 17 (1979), pp. 289320.
[29]Rabin, M., Computable algebra, general theory, and theory of computable fields, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 341360.
[30]Remmel, J.B., Recursive isomorphism types of recursive Boolean algebras, this Journal, vol. 46 (1981), pp. 572594.
[31]Remmel, J.B., Recursively categorical linear orderings, Proceedings of the American Mathematical Society, vol. 83 (1981), pp. 387391.
[32]Richter, L.J., Degrees of structures, this Journal, vol. 46 (1981), pp. 723731.
[33]Soare, R.I., Recursively enumerable sets and degrees, Springer-Verlag, New York, 1987.
[34]Stoltenberg-Hansen, V. and Tucker, J.V., Computable rings and fields, Handbook of computability theory (Griffor, E.R., editor), Elsevier, Amsterdam, 1999, pp. 363447.
[35]Ventsov, Y.G., Effective choice for relations and reducibilities in classes of constructive and positive models, Algebra and Logic, vol. 31 (1992), pp. 6373.
[36]van der Waerden, B.L., Algebra, vol. I, Springer-Verlag, New York, 1970, trans. Blum, F. and Schulenberger, J.R..

Related content

Powered by UNSILO

d-computable categoricity for algebraic fields

  • Russell Miller (a1) (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.