Bounded recursively enumerable sets and degrees
- 15 Downloads
A new reducibility between the recursive sets is defined, which is appropriate to be used in the study of the polynomial reducibility and the NP-problem.
KeywordsBounded recursively enumerable sets relations
Unable to display preview. Download preview PDF.
- Paris, J., and Wilkie, A., Δ0- sets and induction.Open Days in Model Theory and Set Theory (Proceedings of the Jadwish Conference, 1981; W. Guzickiet al., editors).Google Scholar
- Soare, R. I., Recursively Enumerable Sets and Degrees, an study of computable functions and computably generated sets. ω series, Springer-Verlag, 1987.Google Scholar
© Science Press, Beijing China and Allerton Press Inc. 1993