Skip to main content

Hyperarithmetic ultrafilters

  • Conference paper
  • First Online:

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

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Feferman “System of Predicative Analysis” JSL 29 (1964) 1–30

    MathSciNet  MATH  Google Scholar 

  2. S. Feferman, C. Spector “Incompleteness along paths in progressions of Theories”. JSL 27 (1962) 383–390

    MathSciNet  MATH  Google Scholar 

  3. R.M. Friedberg “Three theorems on recursive Enumeration” JSL 23 (1958) 309–316

    MathSciNet  MATH  Google Scholar 

  4. R.O. Gandy “Proof of Mostowski's Conjecture” Bull de L'Acad. Polonaise des Sciences 8 (1960) 571–575

    MathSciNet  MATH  Google Scholar 

  5. A. Grzegorczyk “Elementarily Definable Analysis” Fund. Math. 41 (1955) 311–338

    MathSciNet  MATH  Google Scholar 

  6. S.C. Kleene “On the Forms of Predicates in the theory of Constructive Ordinals” 2nd paper—Amer J. Math 77 (1955) 405–428

    Article  MathSciNet  MATH  Google Scholar 

  7. S.C. Kleene “Arithmetical predicates and Quantifiers” Trans. A.M.S. 79 (1955) 312–340

    Article  MathSciNet  MATH  Google Scholar 

  8. S.C. Kleene “Introduction to Metamathematics”. North Holland Pub.Cp. Amsterdam. 1962

    MATH  Google Scholar 

  9. G. Kreisel “La predicativité” Bull de la Societe. Math de France 88 (1960) 371–391

    MathSciNet  MATH  Google Scholar 

  10. G. Kreisel G. Sacks “Metarecursive Sets”. JSL 30 (1965) 318–338

    MathSciNet  MATH  Google Scholar 

  11. A. Lachlan “On the Lattice of r.e. Sets” Trans. AMS (to appear)

    Google Scholar 

  12. A. Mostowski “A classification of Logical Systems”. Studia Philosphica 4 (1951) 231–274

    MATH  Google Scholar 

  13. A. Mostowski “On Various Degrees of Constructivity” pp. 178–196 of “Constructivity in Mathematics” (A. Heyting) North Holland Pub. Co. Amsterdam.

    Google Scholar 

  14. H. Putnam “Trial and Error predicates and the Solution to a problem of Mostowski” JSL 30 (1965) 49–57.

    MathSciNet  MATH  Google Scholar 

  15. R.W. Robinson “Simplicity of r.e. Sets” JSL 32 (1967) 162–172

    MathSciNet  MATH  Google Scholar 

  16. D. Scott “On Constructing Models for Arithmetic” pp 235–255 of “Infinitistic Methods” Pergamon, 1961.

    Google Scholar 

  17. C. Spector “Recursive well-orderings” JSL 20 (1955) 151–163.

    MathSciNet  MATH  Google Scholar 

  18. H. Weyl “Das Kontinuum. Kritische Untersuchung über die Grundlungen der Analysis” Leipzig 1918.

    Google Scholar 

Download references

Authors

Editor information

M. H. Löb

Rights and permissions

Reprints and permissions

Copyright information

© 1968 Springer-Verlag

About this paper

Cite this paper

Cleave, J.P. (1968). Hyperarithmetic ultrafilters. In: Löb, M.H. (eds) Proceedings of the Summer School in Logic Leeds, 1967. Lecture Notes in Mathematics, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079097

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-35886-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics