Skip to main content

Recursive Properties of Intervals of Recursive Linear Orders

  • Chapter
Logical Methods

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 12))

Abstract

We investigate the possible recursive properties of intervals, and other suborderings, of recursive linear orders. Let A be a recursive linear order with a co-r.e. interval P. We characterize those (A, P) for which there exists a recursive linear order ℬ and an isomorphism f: ℬ ≅ A such that f -1 (P) is (a) not r.e.; (b) immune; (c) hyperimmune. We give general sufficient conditions for A and the subset P under which there exist such ℬ and f with f -1(P) exhibiting the above properties. We show, that no interval P can be hyperhyperimmune (or even strongly hyperimmune).

This work formed part of the author’s doctoral dissertation at Monash University, Melbourne, Australia, under the supervision of Dr C.J. Ash. The author thanks Dr Ash for his guidance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Downey, R.G., Recursion theory and linear orderings. Annals of Pure and Applied Logic. To appear.

    Google Scholar 

  2. Goncharov, S.S. and A.T. Nurtazin [1973], Constructive models of complete solvable theories. Algebra and Logic, 12, 67–77.

    Article  Google Scholar 

  3. Hird, Geoffrey [1984], Recursive Properties of Relations on Models. PhD thesis, Monash University, Melbourne, Australia.

    Google Scholar 

  4. Metakides, G. and A. Nerode [1975], Recursion theory and algebra. In J.N. Crossley (ed.), Algebra and Logic, vol. 450 of Lecture Notes in Mathematics, 209–219. Springer-Verlag, Berlin.

    Chapter  Google Scholar 

  5. Metakides, G. and A. Nerode [1977], Recursively enumerable vector spaces. Annals of Math. Logic, 11, 147–172.

    Article  MathSciNet  MATH  Google Scholar 

  6. Metakides, G. and A. Nerode [1979], Effective content of field theory. Annals of Math. Logic 17, 289–320.

    Article  MathSciNet  MATH  Google Scholar 

  7. Metakides, G. and A. Nerode [1980], Recursion theory on fields and abstract dependence. Journal of Algebra, 65, 36–59.

    Article  MathSciNet  MATH  Google Scholar 

  8. Nerode, A. and J.B. Remmel [1985], A survey of r.e. substructures, American Mathematical Society. Proc. Symposia in Pure Mathematics, 42, 323–373.

    Article  MathSciNet  Google Scholar 

  9. Rogers, Jr., H. [1967], Theory of Effective Functions and Effective Computability. McGraw-Hill Book Co.

    Google Scholar 

  10. Rosenstein, J.G. [1982], Linear Orderings. Academic Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Hird, G. (1993). Recursive Properties of Intervals of Recursive Linear Orders. In: Crossley, J.N., Remmel, J.B., Shore, R.A., Sweedler, M.E. (eds) Logical Methods. Progress in Computer Science and Applied Logic, vol 12. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0325-4_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0325-4_13

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6708-9

  • Online ISBN: 978-1-4612-0325-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics