Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jense, D., and Ehrenfeucht, A., Some problems in elementary arithmetic.Fundamenta Mathematicae, 1976, 92, 223–245.
McAloon, K., On the complexity of models of arithmetic.J. Symbolic Logic, 1982, 47, 403–415.
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).
Soare, R. I., Recursively Enumerable Sets and Degrees, an study of computable functions and computably generated sets. ω series, Springer-Verlag, 1987.
Wilmers, G., Bounded existential induction.J. Symbolic Logic, 1985, 50, 72–90.
Author information
Authors and Affiliations
Additional information
Research partially supported by the Youth NSF grant of China.
Rights and permissions
About this article
Cite this article
Sui, Y. Bounded recursively enumerable sets and degrees. J. of Compt. Sci. & Technol. 8, 205–208 (1993). https://doi.org/10.1007/BF02939527
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02939527