Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T04:02:09.576Z 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 accessRights & 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.)

Information

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

Article purchase

Temporarily unavailable