If you need an accessible version of this item please contact JSTOR User Support

Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication

Richard M. Friedberg
The Journal of Symbolic Logic
Vol. 23, No. 3 (Sep., 1958), pp. 309-316
DOI: 10.2307/2964290
Stable URL: http://www.jstor.org/stable/2964290
Page Count: 8
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication
Preview not available

Page Thumbnails

  • Thumbnail: Page 
309
    309
  • Thumbnail: Page 
310
    310
  • Thumbnail: Page 
311
    311
  • Thumbnail: Page 
312
    312
  • Thumbnail: Page 
313
    313
  • Thumbnail: Page 
314
    314
  • Thumbnail: Page 
315
    315
  • Thumbnail: Page 
316
    316