Skip to main content

Inductive definitions and analogues of large cardinals

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

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   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
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. P. Aczel, The ordinals of the superjump and related functionals, Abstract, this volume pp. 336f.

    Google Scholar 

  2. J. Barwise, R. Gandy and Y. Moschovakis, The next admissible set, J. Symb. Logic 36 (1971), 108–120.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. R. B. Jensen and C. Karp, Primitive recursive set functions, in Axiomatic Set Theory, Part I, ed. Dana S. Scott, Amer. Math. Soc. Proceedings of Symposia in Pure Maths. (1971).

    Google Scholar 

  4. P. Mahlo, Über lineare transfinite Mengen, Berichte über die Verhandlungen der Königlich Sächsischen Gesellschaft der Wissenschaften zu Leipzig, Mathematisch-Physische Klasse 63 (1911), 187–225.

    Google Scholar 

  5. S. Kripke, Transfinite recursions on admissible ordinals, I, II, J. Symb. Logic 29 (1964), 161–162 (abstracts).

    Google Scholar 

  6. S. Kripke, Transfinite recursion, constructible sets, and analogues of cardinals, in: Lecture notes prepared in connection with the Summer Institute on Axiomatic Set Theory held at University of California, Los Angeles, California, July–August, 1967.

    Google Scholar 

  7. A. Lévy, A hierarchy of formulas in set theory, Memoirs of the Amer. Math. Soc. 57, Amer. Math. Soc., Providence, 1965.

    Google Scholar 

  8. A. Lévy, The sizes of the indescribable cardinals, in Axiomatic Set Theory, Part I, ed. Dana S. Scott, Amer. Math. Soc. Proceedings of Symposia in Pure Maths. (1971).

    Google Scholar 

  9. R. A. Platek, Foundations of recursion theory, Ph. D. Thesis and Supplement, Stanford University, 1966.

    Google Scholar 

  10. H. Putnam, On hierarchies and systems of notations, Amer. Math. Soc. Proc. 15 (1964), 44–50.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. W. Richter, Recursively Mahlo ordinals and inductive definitions, in Logic Colloquium '69, R. O. Gandy, C. E. M. Yates (eds.), North-Holland (1971), 273–288.

    Google Scholar 

  12. H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill (1967).

    Google Scholar 

  13. C. Spector, Inductively defined sets of natural numbers, in Infinitistic methods, New York-Oxford-London-Paris and Warsaw (1961), 97–102.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1972 Springer-Verlag

About this paper

Cite this paper

Aczel, P., Richter, W. (1972). Inductive definitions and analogues of large cardinals. In: Hodges, W. (eds) Conference in Mathematical Logic — London ’70. Lecture Notes in Mathematics, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059534

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05744-4

  • Online ISBN: 978-3-540-37162-5

  • eBook Packages: Springer Book Archive