Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-22T04:38:56.914Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on recursive relations

Published online by Cambridge University Press:  12 March 2014

Frederic B. Fitch
Frederic B. Fitch*
Affiliation:
Yale University
Get access Rights & Permissions [Opens in a new window]

Extract

Given a class U which is the result of closing a finite class of expressions with respect to a binary mode of combination, there exists, according to RFBL,1 a recursively enumerable subclass K* of U, and concepts of representation (5.3) and complete representation (6.2) such that:

(a) A relation among members of U is recursively enumerable if and only if it is represented in K*. (6.7.)

(b) A relation among members of U is recursive if and only if it is completely represented in K*. (6.10.)

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 33 , Issue 1 , 26 April 1968 , pp. 107
Copyright
Copyright © Association for Symbolic Logic 1968

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.)

References

1 Fitch, F. B., Recursive functions in basic logic, this Journal, vol. 21 (1956), pp. 337–346Google Scholar. Familiarity with the terminology of this paper is presupposed. For an alternative presentation of the same system, see Hermes, H., Enumerability, decidability, computability, Springer-Verlag, Berlin, 1965, pp. 219–231.CrossRefGoogle Scholar The research in the present paper was supported by NSF-GP-3899.

2 There is, however, a typographical error in line 4 of page 340. The symbol ‘φ’ should appear as part of a subscript expression ‘φ(x1, …, xn)’ to the left of and slightly below the symbol ‘a’, and should not appear, as it does, on the same level as ‘a’.