A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Computable Fields and Arithmetically Definable Ordered Fields

1970
*
Proceedings of the American Mathematical Society
*

Introduction. A computable field is one whose elements may be placed in one-one correspondence with the natural numbers in such a way that the number theoretic functions corresponding to the field operations are recursive. In the same vein a field is called arithmetically definable (AD for short) if its elements may be placed in one-one correspondence with the natural numbers in such a way that the number theoretic functions corresponding to the field operations are arithmetical. These notions

doi:10.2307/2037328
fatcat:wheu26fqynhjrpjjuax45w6i6e