Computable fields and arithmetically definable ordered fields
Authors:
A. H. Lachlan and E. W. Madison
Journal:
Proc. Amer. Math. Soc. 24 (1970), 803-807
MSC:
Primary 02.70
DOI:
https://doi.org/10.1090/S0002-9939-1970-0253897-3
MathSciNet review:
0253897
Full-text PDF Free Access
References | Similar Articles | Additional Information
- A. Fröhlich and J. C. Shepherdson, Effective procedures in field theory, Philos. Trans. Roy. Soc. London Ser. A 248 (1956), 407–432. MR 74349, DOI https://doi.org/10.1098/rsta.1956.0003
- Eugene W. Madison, Computable algebraic structures and nonstandard arithmetic, Trans. Amer. Math. Soc. 130 (1968), 38–54. MR 219416, DOI https://doi.org/10.1090/S0002-9947-1968-0219416-8
- B. H. Mayoh, Unsolvable problems in the theory of computable numbers, Formal Systems and Recursive Functions (Proc. Eighth Logic Colloq., Oxford, 1963) North-Holland, Amsterdam, 1965, pp. 272–279. MR 0209153
- Michael O. Rabin, Computable algebra, general theory and theory of computable fields, Trans. Amer. Math. Soc. 95 (1960), 341–360. MR 113807, DOI https://doi.org/10.1090/S0002-9947-1960-0113807-4
- Alfred Tarski, A decision method for elementary algebra and geometry, University of California Press, Berkeley and Los Angeles, Calif., 1951. 2nd ed. MR 0044472
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 02.70
Retrieve articles in all journals with MSC: 02.70
Additional Information
Article copyright:
© Copyright 1970
American Mathematical Society