We shall show that every recursive predicate is arithmetical. Thus, the arithmetical predicates introduced in § 27.1 are generalizations of recursive predicates. We can divide (§ 29) the arithmetical predicates into classes (which have elements in common) where the smallest class is that of the recursive and a further class is that of the recursively enumerable predicates which we shall discuss in § 28.
KeywordsTuring Machine Free Variable Computable Function Minimal Logic Computable Sequence
Unable to display preview. Download preview PDF.