Skip to main content

Historical and Philosophical Background

  • Chapter
The Combinatory Programme

Part of the book series: Progress in Theoretical Computer Science ((PTCS))

  • 65 Accesses

Abstract

In the fall of 1928 a young American turned up at the Mathematical Institute of Göttingen, a mecca of mathematicians at the time; he was a young man with a dream and his name was H. B. Curry. He felt that he had the tools in hand with which to solve the problem of foundations of mathematics once and for all. His was an approach that came to be called “formalist” and embodied a technique that later became known as Combinatory Logic. Closest to his ideas was the work of Schönfinkel on the “building blocks of mathematical logic” [Sch24], and the man who best knew about this was Bernays, the main collaborator of Hilbert at Göttingen on the latter’s foundational programme. This is why Curry went there to submit his thesis [Cur30].

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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. Barendregt, H.P., The Lambda Calculus, North-Holland, Amsterdam, 1984.

    MATH  Google Scholar 

  2. Church, A., The Calculi of Lambda-Conversion, Princeton University Press, Princeton, N.J., 1941.

    Google Scholar 

  3. Curry, H. B., Grundlagen der kombinatorischen Logik, Amer. J. Math. 52, (1930), 509-536; 789–834.

    Article  MathSciNet  MATH  Google Scholar 

  4. D88] Dedekind, R., Was sind und was sollen die Zahlen? In Gesammelte Werke , 3 (1888?), 335–391.

    Google Scholar 

  5. Engeler, E., Foundations of Mathematics, Springer-Verlag, Berlin and New York, 1993.

    MATH  Google Scholar 

  6. Kleene, S. C., λ-definability and recursiveness, Duke Math. J. 2 (1936), 344–353.

    Article  MathSciNet  Google Scholar 

  7. Rice, H. G., Classes of recursively enumerable sets and their decision problems, Trans. Am. Math. Soc. 74 (1953), 358–366.

    Article  MathSciNet  MATH  Google Scholar 

  8. Schonfinkel, M., Über die Bausteine der mathematischen Logik, Mathem. Annalen 92 (1924), 305–316.

    Article  MathSciNet  Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Birkhäuser Boston

About this chapter

Cite this chapter

Engeler, E. (1995). Historical and Philosophical Background. In: The Combinatory Programme. Progress in Theoretical Computer Science. Birkhäuser Boston. https://doi.org/10.1007/978-1-4612-4268-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-4268-0_1

  • Publisher Name: Birkhäuser Boston

  • Print ISBN: 978-1-4612-8716-2

  • Online ISBN: 978-1-4612-4268-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics