The Combinatory Programme

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

Table of contents

  1. Front Matter
    Pages i-vii
  2. Historical and Philosophical Background

    1. Erwin Engeler
      Pages 1-12
  3. An Algebraization of Universal Algebra

    1. Front Matter
      Pages 13-13
    2. Trudy Weibel
      Pages 14-30
  4. An Algebraization of Formal Properties of Objects

    1. Front Matter
      Pages 57-57
    2. Erwin Engeler, Gerhard Schwärzler
      Pages 58-76
    3. Karl Aberer
      Pages 77-96
  5. Relations to Logical and Computer-Algebraic Calculi

    1. Front Matter
      Pages 97-97
    2. Martin von Mohrenschildt
      Pages 98-116
    3. Daniel Otth
      Pages 117-136
  6. Back Matter
    Pages 137-144

About this book


Combinatory logic started as a programme in the foundation of mathematics and in an historical context at a time when such endeavours attracted the most gifted among the mathematicians. This small volume arose under quite differ­ ent circumstances, namely within the context of reworking the mathematical foundations of computer science. I have been very lucky in finding gifted students who agreed to work with me and chose, for their Ph. D. theses, subjects that arose from my own attempts 1 to create a coherent mathematical view of these foundations. The result of this collaborative work is presented here in the hope that it does justice to the individual contributor and that the reader has a chance of judging the work as a whole. E. Engeler ETH Zurich, April 1994 lCollected in Chapter III, An Algebraization of Algorithmics, in Algorithmic Properties of Structures, Selected Papers of Erwin Engeler, World Scientific PubJ. Co. , Singapore, 1993, pp. 183-257. I Historical and Philosophical Background Erwin Engeler In the fall of 1928 a young American turned up at the Mathematical Institute of Gottingen, 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 mice and for all. His was an approach that came to be called "formalist" and embodied that later became known as Combinatory Logic.


Mathematica algebra algorithm algorithmics algorithms computer computer science logic time

Authors and affiliations

  • Erwin Engeler
    • 1
  1. 1.Department of MathematicsETH-ZentrumZürichSwitzerland

Bibliographic information

  • DOI
  • Copyright Information Birkhäuser Boston 1995
  • Publisher Name Birkhäuser Boston
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4612-8716-2
  • Online ISBN 978-1-4612-4268-0
  • About this book