Abstract
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure \(\overline{F}\) (either \(\overline{\mathbb{Q}}\) or \(\overline{{\mathbb{Z}}/(p)}\)). We consider the Turing degree spectrum of F in both cases, as a structure and as a relation on \(\overline{F}\), and characterize the sets of Turing degrees that are realized as such spectra. The results show a connection between enumerability in the structure F and computability when F is seen as a subfield of \(\overline{F}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Calvert, W., Harizanov, V., Shlapentokh, A.: Turing degrees of isomorphism types of algebraic objects. Journal of the London Math. Soc. 73, 273–286 (2007)
Coles, R.J., Downey, R.G., Slaman, T.A.: Every set has a least jump enumeration. Journal of the London Mathematical Society 62(2), 641–649 (2000)
Edwards, H.M.: Galois Theory. Springer, New York (1984)
Ershov, Y.L.: Theorie der Numerierungen III. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 23(4), 289–371 (1977)
Ershov, Y.L., Goncharov, S.S.: Constructive Models. Kluwer Academic/Plenum Press, New York (2000)
Fried, M.D., Jarden, M.: Field Arithmetic. Springer, Berlin (1986)
Frohlich, A., Shepherdson, J.C.: Effective procedures in field theory. Phil. Trans. Royal Soc. London, Series A 248(950), 407–432 (1956)
Frolov, A., Kalimullin, I., Miller, R.G.: Spectra of algebraic fields and subfields, http://qcpages.qc.cuny.edu/~rmiller/CiE09.pdf
Harizanov, V., Miller, R.: Spectra of structures and relations. Journal of Symbolic Logic 72(1), 324–347 (2007)
Jacobson, N.: Basic Algebra I. W.H. Freeman & Co., New York (1985)
Knight, J.F.: Degrees coded in jumps of orderings. Journal of Symbolic Logic 51, 1034–1042 (1986)
Kronecker, L.: Grundzüge einer arithmetischen Theorie der algebraischen Größen. J. f. Math. 92, 1–122 (1882)
Metakides, G., Nerode, A.: Effective content of field theory. Annals of Mathematical Logic 17, 289–320 (1979)
Miller, R.G.: Computable fields and Galois theory. Notices of the AMS 55(7), 798–807 (2008)
Miller, R.G.: Is it harder to factor a polynomial or to find a root? Transactions of the American Mathematical Society (to appear)
Miller, R.G.: d-Computable categoricity for algebraic fields. The Journal of Symbolic Logic (to appear)
Rabin, M.: Computable algebra, general theory, and theory of computable fields. Transactions of the American Mathematical Society 95, 341–360 (1960)
Richter, L.J.: Degrees of structures. Journal of Symbolic Logic 46, 723–731 (1981)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, New York (1987)
Stoltenberg-Hansen, V., Tucker, J.V.: Computable Rings and Fields. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 363–447. Elsevier, Amsterdam (1999)
van der Waerden, B.L.: Algebra, vol. I. Springer, New York (Hard Cover 1970); trans., Blum, F., Schulenberger, J.R. (2003 softcover)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frolov, A., Kalimullin, I., Miller, R. (2009). Spectra of Algebraic Fields and Subfields. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-03073-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03072-7
Online ISBN: 978-3-642-03073-4
eBook Packages: Computer ScienceComputer Science (R0)