Hostname: page-component-586b7cd67f-dlnhk Total loading time: 0 Render date: 2024-11-25T17:17:35.521Z Has data issue: false hasContentIssue false
  • English
  • Français

Enumeration of Recursive Sets

Published online by Cambridge University Press:  12 March 2014

Yoshindo Suzuki
Yoshindo Suzuki*
Affiliation:
Tokyo Metropolitan University
Get access Rights & Permissions [Opens in a new window]

Extract

It is known [1] p. 312 that a simultaneous enumeration of the recursively enumerable sets can be achieved by a Σ10-predicate. We shall show that a simultaneous enumeration of the recursive sets can be achieved by a predicate of the same form.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 24 , Issue 4 , December 1959 , pp. 311
Copyright
Copyright © Association for Symbolic Logic 1952

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]Friedberg, R. M., Three theorems on recursive enumeration, this Journal, vol. 23 (1958), pp. 309–316.Google Scholar
[2]Kleene, S. C., Introduction to metamathematics, Amsterdam (North Holland), Groningen (Noordhoff), New York and Toronto (Van Nostrand), 1952.Google Scholar