InhaltsverzeichnisI.1 Berechenbarkeit, Aufzählbarkeit.2 Automaten und formale Sprachen.3 Fixpunkttheorie.4 Syntaktische Strukturen.II.5 Gödelisierung und Universalprogramme.6 Unlösbare Probleme der Informatik.7 Rekursive Prozeduren.Bibliographische Schlussbemerkungen.
Focusing on developing a critical mindset in students, this book aims to provide a solid foundation rather than a comprehensive teaching of logic and axiomatization. Originating from lecture notes at ETH, it has been translated into English with great care by dedicated translators, ensuring clarity despite the complex mathematical symbolisms. The work addresses misconceptions held by students who, after extensive training, may feel they understand fundamental concepts like real numbers and Euclidean space, yet lack deeper insight.
The book explores the evolution of combinatory logic, initially a foundational project in mathematics, and its transformation within the realm of computer science. It highlights the collaborative efforts of gifted students who contributed to the mathematical foundations of algorithms under the guidance of Erwin Engeler. The narrative includes historical insights, particularly focusing on H. B. Curry's formalist approach in the late 1920s, which aimed to resolve foundational issues in mathematics through combinatory logic.