Minimal complementation below uniform upper Bounds for the arithmetical degrees
Journal of Symbolic Logic 61 (4):1158-1192 (1996)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| 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 |
Harold T. Hodes (1981). Upper Bounds on Locally Countable Admissible Initial Segments of a Turing Degree Hierarchy. Journal of Symbolic Logic 46 (4):753-760.
S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang (2005). Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees. Journal of Symbolic Logic 70 (3):741 - 766.
Manuel Lerman (1974). Least Upper Bounds for Minimal Pairs of |Alpha-R.E. |Alpha Degrees. Journal of Symbolic Logic 39 (1):49 - 56.
C. T. Chong (1976). Minimal Upper Bounds for Ascending Sequences of Α-Recursively Enumerable Degrees. Journal of Symbolic Logic 41 (1):250-260.
Alexander S. Kechris (1978). Minimal Upper Bounds for Sequences of Δ12n-Degrees. Journal of Symbolic Logic 43 (3):502 - 507.
Harold T. Hodes (1978). Uniform Upper Bounds on Ideals of Turing Degrees. Journal of Symbolic Logic 43 (3):601-612.
Alistair H. Lachlan & Robert I. Soare (1994). Models of Arithmetic and Upper Bounds for Arithmetic Sets. Journal of Symbolic Logic 59 (3):977-983.
Harold T. Hodes (1982). Jumping to a Uniform Upper Bound. Proceedings of the American Mathematical Society 85 (4):600-602.
Harold T. Hodes (1983). More About Uniform Upper Bounds on Ideals of Turing Degrees. Journal of Symbolic Logic 48 (2):441-457.
Masahiro Kumabe (1994). Minimal Upper Bounds for Arithmetical Degrees. Journal of Symbolic Logic 59 (2):516-528.
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? |

