Advertisement

Historical and Philosophical Background

  • Erwin Engeler
Part of the Progress in Theoretical Computer Science book series (PTCS)

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].

Keywords

Algebraic Structure Universal Algebra Combinatory Model Combinatory Logic Lambda Calculus 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bar84]
    Barendregt, H.P., The Lambda Calculus, North-Holland, Amsterdam, 1984.zbMATHGoogle Scholar
  2. [Ch41]
    Church, A., The Calculi of Lambda-Conversion, Princeton University Press, Princeton, N.J., 1941.Google Scholar
  3. [Cur30]
    Curry, H. B., Grundlagen der kombinatorischen Logik, Amer. J. Math. 52, (1930), 509-536; 789–834.MathSciNetzbMATHCrossRefGoogle Scholar
  4. D88] Dedekind, R., Was sind und was sollen die Zahlen? In Gesammelte Werke , 3 (1888?), 335–391.Google Scholar
  5. [Eng93]
    Engeler, E., Foundations of Mathematics, Springer-Verlag, Berlin and New York, 1993.zbMATHGoogle Scholar
  6. [K136]
    Kleene, S. C., λ-definability and recursiveness, Duke Math. J. 2 (1936), 344–353.MathSciNetCrossRefGoogle Scholar
  7. [R53]
    Rice, H. G., Classes of recursively enumerable sets and their decision problems, Trans. Am. Math. Soc. 74 (1953), 358–366.MathSciNetzbMATHCrossRefGoogle Scholar
  8. [Sch24]
    Schonfinkel, M., Über die Bausteine der mathematischen Logik, Mathem. Annalen 92 (1924), 305–316.MathSciNetCrossRefGoogle Scholar

Copyright information

© Birkhäuser Boston 1995

Authors and Affiliations

  • Erwin Engeler

There are no affiliations available

Personalised recommendations