Skip to main content

Enumeration reducibility, nondeterministic computations and relative computability of partial functions

Part of the Lecture Notes in Mathematics book series (LNM,volume 1432)

Keywords

  • Polynomial Time
  • Turing Machine
  • Partial Function
  • Minimal Cover
  • Recursive Operator

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ahmad, Some results on the structure of the Σ 2 enumeration degrees, Recursive Function Theory Newsletter 38 (July, 1989), item 373.

    Google Scholar 

  2. S. Ahmad, Embedding the diamond in the Σ 2 enumeration degrees, to appear.

    Google Scholar 

  3. K. Ambos-Spies, Minimal pairs for polynomial time reducibilities, to appear.

    Google Scholar 

  4. L. Adleman and K. Manders, Reducibility, randomness, and intractibility, Proc. 9th ACM STOC (1977), 151–163.

    Google Scholar 

  5. T. Baker, J. Gill and R. Solovay, Relativizations of the P=NP? question, SIAM J. Comput. 4 (1975), 431–442.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. R. Beigel, W. Gasarch and J. Owings, Terse sets and verbose sets, Recursive Function Theory Newsletter 36 (1987), item 367.

    Google Scholar 

  7. P. Casalegno, On the T-degrees of partial functions, J. Symbolic Logic 50 (1985), 580–588.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. J. Case, Enumeration reducibility and partial degrees, Ann. Math. Log. 2 (1971), 419–439.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. J. Case, Maximal arithmetical reducibilities, Z. Math. Logik Grundlag. Math. 20 (1974), 261–270.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. S. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM STOC (1971), 151–158.

    Google Scholar 

  11. S.B. Cooper, Degrees of unsolvability complementary between recursively enumerable degrees, Part I, Ann. Math. Logic 4 (1972), 31–73.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. S.B. Cooper, Minimal degrees and the jump operator, J. Symbolic Logic 38 (1973), 249–271.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. S.B. Cooper, Minimal pairs and high recursively enumerable degrees, J. Symbolic Logic 39 (1974), 655–660.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. S.B. Cooper, Partial degrees and the density problem, J. Symbolic Logic 47 (1982), 854–859.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. S.B. Cooper, Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ 2 sets are dense, J. Symbolic Logic 49 (1984), 503–513.

    CrossRef  MathSciNet  MATH  Google Scholar 

  16. S.B. Cooper, Enumeration reducibility using bounded information: Counting minimal covers, Z. Math. Logik Grundlag. Math. 33 (1987), 537–560.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. S.B. Cooper, The jump is definable in the structure of the degrees of unsolvability, to appear Bull. Amer. Math. Soc. (1990).

    Google Scholar 

  18. S.B. Cooper, The enumeration degrees are not dense, to appear.

    Google Scholar 

  19. S.B. Cooper and C.S. Copestake, Properly Σ 2 enumeration degrees, Z. Math. Logik Grundlag. Math. 34 (1988), 491–522.

    CrossRef  MathSciNet  MATH  Google Scholar 

  20. S.B. Cooper, S. Lempp and P. Watson, On the degrees of d-r.e. sets, Israel J. Math. 67 (1989), 137–152.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. S.B. Cooper and A. Sorbi, Initial segments of the enumeration degrees, to appear.

    Google Scholar 

  22. C.S. Copestake, The Enumeration Degrees of Σ 2 Sets, Ph.D. Thesis, Leeds University, 1987.

    Google Scholar 

  23. C.S. Copestake, 1-genericity in the enumeration degrees, J. Symbolic Logic 53 (1988), 878–887.

    CrossRef  MathSciNet  MATH  Google Scholar 

  24. C.S. Copestake, 1-generic enumeration degrees below 0' e , to appear in the proceedings of Heyting '88, Bulgaria, 1988 (Plenum Press).

    Google Scholar 

  25. C.S. Copestake, A 1-generic enumeration degree which bounds no minimal pair, to appear.

    Google Scholar 

  26. C.S. Copestake, Nondeterminacy, enumeration reducibility and polynomial bounds, to appear.

    Google Scholar 

  27. W. Craig, On axiomatizability within a system, J. Symbolic Logic 18 (1953), 30–32.

    CrossRef  MathSciNet  MATH  Google Scholar 

  28. M. Davis, “Computability and Unsolvability,” McGraw-Hill, New York, 1958.

    MATH  Google Scholar 

  29. E.Z. Dyment, Certain properties of the Medvedev lattice, Mat. Sb. (new series) 101 (143) (1976), 360–379 (Russian).

    MathSciNet  MATH  Google Scholar 

  30. E.Z. Dyment, Exact bounds of denumerable collections of degrees of difficulty, Mat. Zametki 28 (1980), 899–910 (Russian).

    MathSciNet  MATH  Google Scholar 

  31. S. Feferman, Degrees of unsolvability associated with classes of formalized theories, J. Symbolic Logic 22 (1957), 161–175.

    CrossRef  MathSciNet  MATH  Google Scholar 

  32. S. Feferman, Some applications of the notions of forcing and generic sets, Fund. Math. 56 (1965), 325–345.

    MathSciNet  MATH  Google Scholar 

  33. R.M. Friedberg and H. Rogers, Jr., Reducibility and completeness for sets of integers, Z. Math. Logik Grundlag. Math. 5 (1959), 117–125.

    CrossRef  MathSciNet  MATH  Google Scholar 

  34. L. Gutteridge, Some Results on Enumeration Reducibility, Ph.D. Dissertation, Simon Frazer University, 1971.

    Google Scholar 

  35. C.A. Haught, The degrees below a 1-generic degree and less than 0', J. Symbolic Logic 51 (1986), 770–777.

    CrossRef  MathSciNet  MATH  Google Scholar 

  36. F. Hebeisen, Masstheoretische Ergebnisse fur WT-Grade, Z. Math. Logik Grundlag. Math. 25 (1979), 33–36.

    CrossRef  MathSciNet  MATH  Google Scholar 

  37. F. Hebeisen, Uber Halbordnungen von WT-Graden in e-Graden, Z. Math. Logik Grundlag. Math. 25 (1979), 209–212.

    CrossRef  MathSciNet  MATH  Google Scholar 

  38. P.G. Hinman, Some applications of forcing to hierarchy problems in arithmetic, Z. Math. Logik Grundlag. Math. 15 (1969), 341–352.

    CrossRef  MathSciNet  MATH  Google Scholar 

  39. C.G. Jockusch Jr., Reducibilities in Recursive Function Theory, Ph.D. Dissertation, MIT, Cambridge, Mass.,1966.

    Google Scholar 

  40. C.G. Jockusch Jr., Semirecursive sets and positive reducibility, Trans. Amer. Math. Soc. 131 (1968), 420–436.

    CrossRef  MathSciNet  MATH  Google Scholar 

  41. C.G. Jockusch Jr., Upward closure and cohesive degrees, Israel J. Math. 15 (1973), 332–335.

    CrossRef  MathSciNet  MATH  Google Scholar 

  42. C.G. Jockusch Jr., Degrees of generic sets, in F.R. Drake and S.S. Wainer, eds., Recursion Theory: its Generalisations and Applications, Proc. of Logic Colloquium, Leeds, 1979 (Cambridge University Press, 1980), 110–139.

    Google Scholar 

  43. N.D. Jones, Reducibility among combinatorial problems in log n space, in Proc. of Seventh Annual Princeton Conference on Information Sciences and Systems, 1973.

    Google Scholar 

  44. R. Karp, Reducibility among combinatorial problems, in Miller and Thatcher, eds., Complexity of Computer Computations (Plenum Press, New York, 1972), 85–103.

    CrossRef  Google Scholar 

  45. S.C. Kleene, “Introduction to Metamathematics,” Van Nostrand, New York, 1952.

    MATH  Google Scholar 

  46. S.C. Kleene and E.L. Post, The upper semi-lattice of degrees of recursive unsolvability, Ann. of Math. (2) 59 (1954), 379–407.

    CrossRef  MathSciNet  MATH  Google Scholar 

  47. A.H. Lachlan, Some notions of reducibility and productiveness, Z. Math. Logik Grundlag. Math. 11 (1965), 17–44.

    CrossRef  MathSciNet  MATH  Google Scholar 

  48. A.H. Lachlan, Lower bounds for pairs of recursively enumerable degrees, Proc. London Math. Soc. 16 (1966), 537–569.

    CrossRef  MathSciNet  MATH  Google Scholar 

  49. A.H. Lachlan, Initial segments of many-one degrees, Canad. J. Math. 22 (1970), 75–85.

    CrossRef  MathSciNet  MATH  Google Scholar 

  50. A.H. Lachlan, Embedding nondistributive lattices in the recursively enumerable degrees, in W. Hodges, ed., Conference in Mathematical Logic, London, 1970 (Springer-Verlag, Berlin, 1972), 149–177.

    Google Scholar 

  51. A.H. Lachlan, Bounding minimal pairs, J. Symbolic Logic 44 (1979), 626–642.

    CrossRef  MathSciNet  MATH  Google Scholar 

  52. R. Ladner, N. Lynch and A. Selman, A comparison of polynomial time reducibilities, Theoret. Comput. Sci. 1 (1975), 103–123.

    CrossRef  MathSciNet  MATH  Google Scholar 

  53. J. Lagemann, Embedding Theorems in the Reducibility Ordering of the Partial Degrees, Ph.D. Dissertation, MIT, 1972.

    Google Scholar 

  54. M. Lerman, “Degrees of Unsolvability,” Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983.

    CrossRef  MATH  Google Scholar 

  55. T.J. Long, Strong nondeterministic polynomial-time reducibilities, Theoret. Comput. Sci. 21 (1982), 1–25.

    CrossRef  MathSciNet  MATH  Google Scholar 

  56. K. McEvoy, The Structure of the Enumeration Degrees, Ph.D. Thesis, Leeds University, 1984.

    Google Scholar 

  57. K. McEvoy, Jumps of quasi-minimal enumeration degrees, J. Symbolic Logic 50 (1985), 839–848.

    CrossRef  MathSciNet  MATH  Google Scholar 

  58. K. McEvoy and S.B. Cooper, On minimal pairs of enumeration degrees, J. Symbolic Logic 50 (1985), 983–1001.

    CrossRef  MathSciNet  MATH  Google Scholar 

  59. Yu.T. Medvedev, Degrees of difficulty of the mass problem, Dokl. Akad. Nauk SSSR, N.S. 104 (1955), 501–504 (Russian).

    MathSciNet  Google Scholar 

  60. A.R. Meyer and L.J. Stockmeyer, The equivalence of regular expressions with squaring requires exponential space, in Proc. Thirteenth Annual IEEE Symposium on Switching and Automata Theory (1972), 125–129.

    Google Scholar 

  61. A.R. Meyer and L.J. Stockmeyer, Word problems requiring exponential time, in Proc. Fifth Annual Symposium on Theory of Computing (1973).

    Google Scholar 

  62. B.B. Moore, Structure of the Degrees of Enumeration Reducibility, Ph.D. Dissertation, Syracuse University, 1974.

    Google Scholar 

  63. J. Myhill, A note on degrees of partial functions, Proc. Amer. Math. Soc. 12 (1961), 519–521.

    CrossRef  MathSciNet  MATH  Google Scholar 

  64. J. Myhill and J.C. Shepherdson, Effective operations on partial recursive functions, Z. Math. Logik Grundlag. Math. 1 (1955), 310–317.

    CrossRef  MathSciNet  MATH  Google Scholar 

  65. A. Nerode and R.A. Shore, Second order logic and first order theories of reducibility orderings, in J. Barwise et al, eds., The Kleene symposium (North-Holland, Amsterdam, 1980), 181–200.

    CrossRef  Google Scholar 

  66. P. Odifreddi, Strong reducibilities, Bull. Amer. Math. Soc. (N.S.) 4 (1981), 37–86.

    CrossRef  MathSciNet  MATH  Google Scholar 

  67. P. Odifreddi, “Classical Recursion Theory,” North-Holland, Amsterdam, New York, Oxford, 1989.

    MATH  Google Scholar 

  68. P. Odifreddi, “Classical Recursion Theory, Vol. II,” North-Holland, Amsterdam, New York, Oxford, to appear.

    Google Scholar 

  69. G.D. Plotkin, A set-theoretical definition of application, Memo. MIP-R-95, School of Artificial Intelligence, University of Edinburgh, 1972.

    Google Scholar 

  70. E.A. Polyakov and M.G. Rozinas, Enumeration reducibilities, Sib. Math. J. 18 (1977), 594–599.

    CrossRef  MATH  Google Scholar 

  71. E.A. Polyakov and M.G. Rozinas, Relationships between different forms of relative computability, Math. USSR-Sbornik 35 (1979), 425–436.

    CrossRef  MATH  Google Scholar 

  72. D. Posner, High Degrees, Ph.D. Dissertation, University of California, Berkeley, 1977.

    Google Scholar 

  73. E.L. Post, Recursively enumerable sets of positive integers and their decision problems, Bull. Amer. Math. Soc. 50 (1944), 304–337.

    CrossRef  MathSciNet  MATH  Google Scholar 

  74. R.W. Robinson, A dichotomy of the recursively enumerable sets, Z. Math. Logik Grundlag. Math. 14 (1968), 339–356.

    CrossRef  MathSciNet  MATH  Google Scholar 

  75. H. Rogers Jr., “Theory of Recursive Functions and Effective Computability,” McGraw-Hill, New York, 1967.

    MATH  Google Scholar 

  76. M.G. Rozinas, Partial degrees and τ-degrees, Siberian Math. J. 15 (1974), 935–941.

    CrossRef  MathSciNet  MATH  Google Scholar 

  77. M.G. Rozinas, The semilattice of e-degrees, Ivanov. Gos. Univ., Ivanovo (1978), 71–84 (Russian).

    Google Scholar 

  78. M.G. Rozinas, Partial degrees of immune and hyperimmune sets, Siberian Math. J. 19 (1978), 613–616.

    CrossRef  MathSciNet  MATH  Google Scholar 

  79. G.E. Sacks, A minimal degree less than 0', Bull. Amer. Math. Soc. 67 (1961), 416–419.

    CrossRef  MathSciNet  MATH  Google Scholar 

  80. G.E. Sacks, Recursive enumerability and the jump operator, Trans. Amer. Math. Soc. 108 (1963), 223–239.

    CrossRef  MathSciNet  MATH  Google Scholar 

  81. L.E. Sanchis, Hyperenumeration reducibility, Notre Dame J. Formal Logic 19 (1978), 405–415.

    CrossRef  MathSciNet  MATH  Google Scholar 

  82. L.E. Sanchis, Reducibilities in two models for combinatory logic, J. Symbolic Logic 44 (1979), 221–233.

    CrossRef  MathSciNet  MATH  Google Scholar 

  83. L.P. Sasso Jr., Degrees of Unsolvability of Partial Functions, Ph.D. Dissertation, University of California, Berkeley, 1971.

    MATH  Google Scholar 

  84. L.P. Sasso Jr., A minimal partial degree ≤ 0', Proc. Amer. Math. Soc. 38 (1973), 388–392.

    MathSciNet  MATH  Google Scholar 

  85. L.P. Sasso Jr., A survey of partial degrees, J. Symbolic Logic 40 (1975), 130–140.

    CrossRef  MathSciNet  MATH  Google Scholar 

  86. D. Scott, Lambda calculus and recursion theory, in Kanger, ed., Proc. Third Scandinavian Logic Sympos. (North-Holland, Amsterdam, 1975), 154–193.

    CrossRef  Google Scholar 

  87. D. Scott, Data types as lattices, in Proc. Logic Conf., Kiel, SVLNM 499 (1975), 579–651.

    MathSciNet  MATH  Google Scholar 

  88. A.L. Selman, Arithmetical reducibilities I, Z. Math. Logik Grundlag. Math. 17 (1971), 335–350.

    CrossRef  MathSciNet  MATH  Google Scholar 

  89. A.L. Selman, Arithmetical reducibilities II, Z. Math. Logik Grundlag. Math. 18 (1972), 83–92.

    CrossRef  MathSciNet  MATH  Google Scholar 

  90. A.L. Selman, Polynomial time enumeration reducibility, SIAM J. Comput. 7 (1978), 440–457.

    CrossRef  MathSciNet  MATH  Google Scholar 

  91. J. Shinoda and T.A. Slaman, On the theory of the polynomial degrees of the recursive sets, to appear.

    Google Scholar 

  92. J.R. Shoenfield, On degrees of unsolvability, Ann. of Math. (2) 69 (1959), 644–653.

    CrossRef  MathSciNet  MATH  Google Scholar 

  93. J.R. Shoenfield, A theorem on minimal degrees, J. Symbolic Logic 31 (1966), 539–544.

    CrossRef  MathSciNet  MATH  Google Scholar 

  94. A. Silver, Polynomial time singleton enumeration reducibilities, to appear.

    Google Scholar 

  95. D.G. Skordev, On partial conjunctive reducibility, in Second All-Union Conference on Math. Logic, Inst. Prikl. Mat. (1972), 43–44.

    Google Scholar 

  96. T.A. Slaman and W.H. Woodin, Definability in the degrees, to appear.

    Google Scholar 

  97. B.Ya. Solon, e-powers of hyperimmune retraceable sets, Siberian Math. J. 19 (1978), 122–127.

    CrossRef  MathSciNet  MATH  Google Scholar 

  98. R.I. Soare, “Recursively Enumerable Sets and Degrees,” Springer-Verlag, Berlin, New York, London, Tokyo, 1987.

    CrossRef  MATH  Google Scholar 

  99. A. Sorbi, On quasi-minimal e-degrees and total e-degrees, Proc. Amer. Math. Soc. 102 (1988), 1005–1008.

    MathSciNet  MATH  Google Scholar 

  100. A. Sorbi, Some remarks on the algebraic structure of the Medvedev lattice, to appear.

    Google Scholar 

  101. A. Sorbi, On some filters and ideals of the Medvedev lattice, to appear.

    Google Scholar 

  102. A. Sorbi, Embedding Brouwer algebras in the Medvedev lattice, to appear.

    Google Scholar 

  103. C. Spector, On degrees of recursive unsolvability, Ann. of Math. (2) 64 (1956), 581–592.

    CrossRef  MathSciNet  MATH  Google Scholar 

  104. V. Vuckovic, Almost recursivity and partial degrees, Z. Math. Logik Grundlag. Math. 20 (1974), 419–426.

    CrossRef  MathSciNet  MATH  Google Scholar 

  105. P. Watson, On restricted forms of enumeration reducibility, to appear.

    Google Scholar 

  106. C.E.M. Yates, Three theorems on the degree of recursively enumerable sets, Duke Math. J. 32 (1965), 461–468.

    CrossRef  MathSciNet  MATH  Google Scholar 

  107. S.D. Zakharov, e-and s-degrees, Algebra and Logic 23 (1984), 273–281.

    CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Cooper, S.B. (1990). Enumeration reducibility, nondeterministic computations and relative computability of partial functions. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086114

Download citation

  • DOI: https://doi.org/10.1007/BFb0086114

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52772-5

  • Online ISBN: 978-3-540-47142-4

  • eBook Packages: Springer Book Archive