Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T05:27:16.169Z Has data issue: false hasContentIssue false

Arithmetical representation of recursively enumerable sets

Published online by Cambridge University Press:  12 March 2014

Raphael M. Robinson*
Affiliation:
University of California, Berkeley, California

Extract

A set S of natural numbers is called recursively enumerable if there is a general recursive function F(x, y) such that

In other words, S is the projection of a two-dimensional general recursive set. Actually, it is no restriction on S to assume that F(x, y) is primitive recursive. If S is not empty, it is the range of the primitive recursive function

where a is a fixed element of S. Using pairing functions, we see that any non-empty recursively enumerable set is also the range of a primitive recursive function of one variable.

We use throughout the logical symbols ⋀ (and), ⋁ (or), → (if…then…), ↔ (if and only if), ∧ (for every), and ∨(there exists); negation does not occur explicitly. The variables range over the natural numbers, except as otherwise noted.

Martin Davis has shown that every recursively enumerable set S of natural numbers can be represented in the form

where P(y, b, w, x1 …, xλ) is a polynomial with integer coefficients. (Notice that this would not be correct if we replaced ≤ by <, since the right side of the equivalence would always be satisfied by b = 0.) Conversely, every set S represented by a formula of the above form is recursively enumerable. A basic unsolved problem is whether S can be defined using only existential quantifiers.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1956

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable