A CHARACTERIZATION THEOREM FOR COMPUTABLE ORDERED FIELDS.
Abstract
M. Rabin has characterized the computable groups as those which have a solvable word problem. The purpose of this paper is to establish a characterization theorem for the computable ordered fields. The main result is that an ordered field T is computable if and only if there is a finite sequence alpha sub 1,..., alpha sub n epsilon T algebraically independent over the rationals Q such that Q(alpha sub 1,..., alpha sub n)=T sub 1 is computable ordered and T is strongly recursively enumerable over Q. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1969
- Accession Number
- AD0697660
Entities
People
- Eugene W. Madison
Organizations
- University of Iowa