Some Remarks on Computable (Non-Archimedean) Ordered Fields.
Abstract
In this paper two results of Lachlan and Madison are generalized. (1) The theorem which characterizes all computable Archimedean ordered algebraic extensions as those which are s.r.e. over 2, the field of rationals. (2) The theorem which characterizes 2 sup c (the field of recursive real numbers) as the minimal ordered extension of 2 which contains all computable Archimedean ordered fields. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1970
- Accession Number
- AD0714169
Entities
People
- Eugene W. Madison
Organizations
- University of Iowa