Uniform enumeration operations
Journal of Symbolic Logic 40 (3):401-409 (1975)
| Abstract | Sacks [2] has asked whether there exists a uniform solution to Post's problem, i.e. an enumeration operation W such that $\mathbf{d} for every degree d. It is shown here that if such an operation W exists it cannot itself in a particular technical sense be uniform. In fact, the jump operation is characterized amongst such uniform enumeration operations by the condition: $\mathbf{d} for all d. In addition, it is proved that the only other uniform enumeration operations such that d ≤ W (d) for all d are those which equal the identity operation above some fixed degrees | |||||||||
| 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,701 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesHarold T. Hodes (1983). More About Uniform Upper Bounds on Ideals of Turing Degrees. Journal of Symbolic Logic 48 (2):441-457.
Richard M. Friedberg (1958). Three Theorems on Recursive Enumeration. I. Decomposition. II. Maximal Set. III. Enumeration Without Duplication. Journal of Symbolic Logic 23 (3):309-316.
A. M. Dawes (1982). Splitting Theorems for Speed-Up Related to Order of Enumeration. Journal of Symbolic Logic 47 (1):1-7.
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.
S. Barry Cooper & Andrea Sorbi (1996). Noncappable Enumeration Degrees Below 0'e. Journal of Symbolic Logic 61 (4):1347 - 1363.
Harold T. Hodes (1982). Jumping to a Uniform Upper Bound. Proceedings of the American Mathematical Society 85 (4):600-602.
Sven Ove Hansson (2012). Global and Iterated Contraction and Revision: An Exploration of Uniform and Semi-Uniform Approaches. Journal of Philosophical Logic 41 (1):143-172.
André Nies & Andrea Sorbi (2000). Structural Properties and Σ02 Enumeration Degrees. Journal of Symbolic Logic 65 (1):285 - 292.
Rodolfo Cristian Ertola Biraben & Hernán Javier San Martín (2011). On Some Compatible Operations on Heyting Algebras. Studia Logica 98 (3):331-345.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
