Journal of Symbolic Logic 59 (1):166-181 (1994)
In this paper we define and study conditional problems and their degrees. The main result is that the class of conditional degrees is a lattice extending the ordinary Turing degrees and it is dense. These properties are not shared by ordinary Turing degrees. We show that the class of conditional many-one degrees is a distributive lattice. We also consider properties of semidecidable problems and their degrees, which are analogous to r.e. sets and degrees
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Local Initial Segments of the Turing Degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
The Density of the Meet-Inaccessible R.E. Degrees.Zhang Qinglong - 1992 - Journal of Symbolic Logic 57 (2):585-596.
Maximal Contiguous Degrees.Peter Cholak, Rod Downey & Stephen Walk - 2002 - Journal of Symbolic Logic 67 (1):409-437.
Wtt-Degrees and T-Degrees of R.E. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
Added to index2009-01-28
Total downloads6 ( #557,642 of 2,168,638 )
Recent downloads (6 months)1 ( #346,816 of 2,168,638 )
How can I increase my downloads?