The role of true finiteness in the admissible recursively enumerable degrees
Bulletin of Symbolic Logic 11 (3):398-410 (2005)
| Abstract | We show, however, that this is not always the case. | |||||||||
| Keywords | Recursion theory Recursively enumerable sets Finite, The | |||||||||
| Categories | ||||||||||
| Buy the book | $54.00 new (10% off) $60.00 direct from Amazon $99.96 used Amazon page | |||||||||
| Call number | QA9.6.A57 no. 854 | |||||||||
| ISBN(s) | 0821838857 9780821838853 | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Configure |
Similar books and articlesE. Herrmann (1984). Definable Structures in the Lattice of Recursively Enumerable Sets. Journal of Symbolic Logic 49 (4):1190-1197.
Michael E. Mytilinaios & Theodore A. Slaman (1988). Σ2-Collection and the Infinite Injury Priority Method. Journal of Symbolic Logic 53 (1):212 - 221.
Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman (1996). The Sacks Density Theorem and Σ2-Bounding. Journal of Symbolic Logic 61 (2):450 - 467.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
A. M. Dawes (1982). Splitting Theorems for Speed-Up Related to Order of Enumeration. Journal of Symbolic Logic 47 (1):1-7.
Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman (1996). Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. Journal of Symbolic Logic 61 (3):880-905.
Wolfgang Maass (1982). Recursively Enumerable Generic Sets. Journal of Symbolic Logic 47 (4):809-823.
Iraj Kalantari & Allen Retzlaff (1979). Recursive Constructions in Topological Spaces. Journal of Symbolic Logic 44 (4):609-625.
Wolfgang Maass (1984). On the Orbits of Hyperhypersimple Sets. Journal of Symbolic Logic 49 (1):51-62.
Stephan Wehner (1999). On Recursive Enumerability with Finite Repetitions. Journal of Symbolic Logic 64 (3):927-945.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads2 ( #232,382 of 549,065 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
