Skip to main content

Array nonrecursive sets and multiple permitting arguments

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

Abstract

We study a class of permitting arguments in which each positive requirement needs multiple permissions to succeed. Three natural examples of such constructions are given. We introduce a class of r. e. sets, the array nonrecursive sets, which consists of precisely those sets which allow enough permission for these constructions be performed. We classify the degrees of array nonrecursive sets and so classify the degrees in which each of these constructions can be performed.

Keywords

  • State Diagram
  • Recursive Function
  • Peano Arithmetic
  • Recursive Approximation
  • Dense Simple

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 work was partially supported by National Science Foundation Grants DMS88-00030 to Stob and DMS86-01242 to Jockusch and Downey and also a New Zealand-United States Cooperative Science Program Grant from the National Science Foundation to all three authors. This paper is in final form and no similar paper has been or will be submitted elsewhere.

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. K. Ambos-Spies, C. G. Jockusch Jr., R. A. Shore, and R. I. Soare, An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Trans. Amer. Math. Soc. 281 (1984) 109–128.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. R. G. Downey, Maximal theories, Journal of Pure and Applied Logic 33 (1987) 245–282.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. R. G. Downey, Array nonrecursive degrees and lattice embeddings of the diamond, to appear.

    Google Scholar 

  5. R. Downey and C. G. Jockusch Jr., T-degrees, jump classes and strong reducibilities, Trans. Amer. Math. Soc. 301 (1987) 103–136.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. C. G. Jockusch Jr., Degrees in which the recursive sets are uniformly recursive, Canadian Journal of Mathematics 24 (1971) 1092–1099.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. C. G. Jockusch Jr. and R. I. Soare, Π0 1 classes and degrees of theories, Trans. Amer. Math. Soc. 173 (1972) 33–56.

    MathSciNet  MATH  Google Scholar 

  9. A. Kučera, An alternative, priority-free solution to Post's problem, Proceedings MFCS '86, Lecture Notes in Computer Science, Springer-Verlag.

    Google Scholar 

  10. A. H. Lachlan, Embedding nondistributive lattices in the recursively enumerable degrees, Conference in Mathematical Logic — London 1970, Lecture Notes in Mathematics, vol 255, (1972) Springer-Verlag 149–157.

    Google Scholar 

  11. W. Maass, R. A. Shore, and M. Stob, Splitting properties and jump classes, Israel J. Math. 39 (1981) 210–224.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. D. A. Martin, Classes of recursively enumerable sets and degrees of unsolvability, Z. Math. Grundlag. Math. 12 (1966) 295–310.

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. D. A. Martin and M. B. Pour-El, Axiomatizable theories with few axiomatizable extensions, J. Symbolic Logic 35 (1970) 205–209.

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. R. W. Robinson, Simplicity of recursively enumerable sets, J. Symbolic Logic 32 (1967) 162–172.

    CrossRef  MathSciNet  MATH  Google Scholar 

  15. R. I. Soare, Recursively enumerable sets and degrees (1987) Springer-Verlag.

    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

Downey, R., Jockusch, C., Stob, M. (1990). Array nonrecursive sets and multiple permitting arguments. 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/BFb0086116

Download citation

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

  • 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