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 | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesSteffen Lempp & Andrea Sorbi (2002). Embedding Finite Lattices Into the Σ02 Enumeration Degrees. Journal of Symbolic Logic 67 (1):69 - 90.
Steffen Lempp & Theodore A. Slaman (1989). A Limit on Relative Genericity in the Recursively Enumerable Sets. Journal of Symbolic Logic 54 (2):376-395.
William C. Calhoun & Theodore A. Slaman (1996). The Π02 Enumeration Degrees Are Not Dense. Journal of Symbolic Logic 61 (4):1364 - 1379.
Thomas F. Kent (2006). The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable. Journal of Symbolic Logic 71 (4):1284 - 1302.
Yoshindo Suzuki (1959). Enumeration of Recursive Sets. Journal of Symbolic Logic 24 (4):311.
S. Barry Cooper & Andrea Sorbi (1996). Noncappable Enumeration Degrees Below 0'e. Journal of Symbolic Logic 61 (4):1347 - 1363.
A. H. Lachlan (1975). Uniform Enumeration Operations. Journal of Symbolic Logic 40 (3):401-409.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
A. M. Dawes (1982). Splitting Theorems for Speed-Up Related to Order of Enumeration. Journal of Symbolic Logic 47 (1):1-7.
Jaakko Hintikka (2011). What is the Axiomatic Method? Synthese 183 (1):69-85.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads11 ( #99,523 of 549,088 )Recent downloads (6 months)1 ( #63,317 of 549,088 )How can I increase my downloads? |
My notes
Discussion
