Graduate studies at Western
Journal of Symbolic Logic 59 (1):166-181 (1994)
|Abstract||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)|
|Through your library||Configure|
Similar books and articles
Bjørn Kjos-Hanssen (2003). Local Initial Segments of the Turing Degrees. Bulletin of Symbolic Logic 9 (1):26-36.
Gregor Betz (2012). On Degrees of Justification. Erkenntnis 77 (2):237-272.
Richard Bradley (1999). Conditional Desirability. Theory and Decision 47 (1):23-55.
Theodore A. Slaman & John R. Steel (1989). Complementation in the Turing Degrees. Journal of Symbolic Logic 54 (1):160-176.
Zhang Qinglong (1992). The Density of the Meet-Inaccessible R.E. Degrees. Journal of Symbolic Logic 57 (2):585-596.
Stephen G. Simpson (2005). Mass Problems and Randomness. Bulletin of Symbolic Logic 11 (1):1-27.
Guohua Wu (2006). Jump Operator and Yates Degrees. Journal of Symbolic Logic 71 (1):252 - 264.
Peter Cholak, Rod Downey & Stephen Walk (2002). Maximal Contiguous Degrees. Journal of Symbolic Logic 67 (1):409-437.
Michael Stob (1983). Wtt-Degrees and T-Degrees of R.E. Sets. Journal of Symbolic Logic 48 (4):921-930.
Guohua Wu (2004). Bi-Isolation in the D.C.E. Degrees. Journal of Symbolic Logic 69 (2):409 - 420.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?