Three theorems on recursive enumeration. I. decomposition. II. maximal set. III. enumeration without duplication

Journal of Symbolic Logic 23 (3):309-316 (1958)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2964290
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 20,038
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
E. K. Blum (1965). Enumeration of Recursive Sets By Turing Machine. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):197-201.
E. K. Blum (1965). Enumeration of Recursive Sets By Turing Machine. Mathematical Logic Quarterly 11 (3):197-201.
Giacomo Lenzi (2011). On a Positive Set Theory with Inequality. Mathematical Logic Quarterly 57 (5):474-480.
C. T. Chong (1989). Hyperhypersimple Sets and Δ2 Systems. Annals of Pure and Applied Logic 44 (1-2):25-38.

View all 6 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

25 ( #150,252 of 1,793,171 )

Recent downloads (6 months)

4 ( #205,956 of 1,793,171 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.