Accession Number : AD0697660

Title :   A CHARACTERIZATION THEOREM FOR COMPUTABLE ORDERED FIELDS.

Descriptive Note : Technical rept.,

Corporate Author : IOWA UNIV IOWA CITY DEPT OF MATHEMATICS

Personal Author(s) : Madison,Eugene W.

Report Date : NOV 1969

Pagination or Media Count : 14

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)

Descriptors :   (*MATHEMATICAL LOGIC, THEOREMS), RECURSIVE FUNCTIONS, GROUPS(MATHEMATICS), AUTOMATA

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE