Minimal complementation below uniform upper Bounds for the arithmetical degrees

Journal of Symbolic Logic 61 (4):1158-1192 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2275810

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Jumping to a Uniform Upper Bound.Harold T. Hodes - 1982 - Proceedings of the American Mathematical Society 85 (4):600-602.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1978 - Journal of Symbolic Logic 43 (3):601-612.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Minimal upper Bounds for arithmetical degrees.Masahiro Kumabe - 1994 - Journal of Symbolic Logic 59 (2):516-528.

Analytics

Added to PP
2009-01-28

Downloads
39 (#398,894)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.

Add more references