Article contents
The degrees of conditional problems
Published online by Cambridge University Press: 12 March 2014
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 1994
References
REFERENCES
- 1
- Cited by