Skip to main content
SpringerLink
Log in

Measure and categoricity in α-recursion

  • Contributed Papers
  • Conference paper
  • First Online:
Set Theory and Hierarchy Theory A Memorial Tribute to Andrzej Mostowski

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

  • 360 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.95
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Kelley, General topology, Van Nostrand-Reinhold, New York, 1955.

    MATH  Google Scholar 

  2. G. Kreisel, Some reasons for generalising recursion theory in “Logic Colloquium 69”, North Holland, Amsterdam, 1971, 139–198.

    Google Scholar 

  3. G. Kreisel and G.E. Sacks, Metarecursive sets, Journal of Symbolic Logic, 30, (1965), 318–338.

    Article  MathSciNet  MATH  Google Scholar 

  4. D.A. Martin, Measure, Category and degrees of unsolvability (mimeograph notes).

    Google Scholar 

  5. J. Myhill, Category methods in recursion theory, Pacific Journal of Mathematics, 11 (1961), 1479–1486.

    Article  MathSciNet  MATH  Google Scholar 

  6. H. Rogers, Theory of recursive functions and effective computability, Mc Graw-Hill, New York, 1967.

    MATH  Google Scholar 

  7. G.E. Sacks, Degrees of Unsolvability, Annals of Mathematics, Study no 55, Princeton, 1963.

    Google Scholar 

  8. G.E. Sacks, Measure-theoretic uniformity in recursion theory and set theory, Transactions of the American Mathematical Society, 142 (1969), 381–420.

    Article  MathSciNet  MATH  Google Scholar 

  9. G.E. Sacks, Higher recursion theory (mimeograph notes).

    Google Scholar 

  10. G.E. Sacks, Countable admissible ardinals and hyper-degrees (mimeograph notes).

    Google Scholar 

  11. J. Shoenfield, On degrees of unsolvability, Annals of Mathematics, 39 (1959), 644–653.

    Article  MathSciNet  MATH  Google Scholar 

  12. H. Tanaka, Some results in the effective set theory, Publ. R.I.M.S. Kyoto University, Ser. A, 3 (1967), 11–52.

    Article  MathSciNet  MATH  Google Scholar 

  13. H. Tanaka, Notes on measure and category in recursion theory, Annals of the Japan Association of Philisophical Sciences, 3 (1970), 43–53.

    MathSciNet  Google Scholar 

  14. S. Willard, General topology, Addison-Wesley Reading, 1970.

    Google Scholar 

  15. C.E.M. Yates, Banach Mazur Games, comeager sets and degrees of unsolvability (mimeograph notes).

    Google Scholar 

  16. C.E.M. Yates, A General framework for Δ 02 and Σ 01 priority arguments(mimeograph notes).

    Google Scholar 

  17. C.E.M. Yates, Prioric games and minimal degrees below O′, Fundamenta Mathematicae, LXXXII, (1974), 217–237.

    MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. F. Lowenthal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wiktor Marek Marian Srebrny Andrzej Zarach

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag

About this paper

Cite this paper

Lowenthal, F. (1976). Measure and categoricity in α-recursion. In: Marek, W., Srebrny, M., Zarach, A. (eds) Set Theory and Hierarchy Theory A Memorial Tribute to Andrzej Mostowski. Lecture Notes in Mathematics, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0096901

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07856-2

  • Online ISBN: 978-3-540-38122-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation