Advertisement

Journal of Computer Science and Technology

, Volume 8, Issue 3, pp 205–208 | Cite as

Bounded recursively enumerable sets and degrees

  • Yuefei Sui
Regular Papers
  • 15 Downloads

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.

Keywords

Bounded recursively enumerable sets relations 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Jense, D., and Ehrenfeucht, A., Some problems in elementary arithmetic.Fundamenta Mathematicae, 1976, 92, 223–245.MathSciNetGoogle Scholar
  2. [2]
    McAloon, K., On the complexity of models of arithmetic.J. Symbolic Logic, 1982, 47, 403–415.MATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    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
  4. [4]
    Soare, R. I., Recursively Enumerable Sets and Degrees, an study of computable functions and computably generated sets. ω series, Springer-Verlag, 1987.Google Scholar
  5. [5]
    Wilmers, G., Bounded existential induction.J. Symbolic Logic, 1985, 50, 72–90.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1993

Authors and Affiliations

  • Yuefei Sui
    • 1
  1. 1.Institute of SoftwareAcademia SinicaBeijing

Personalised recommendations