Combinators, ?-Terms and Proof Theory
Published on 12. October 2011
Book
Paperback/Softback
X, 177 pages
978-94-010-2915-5 (ISBN)
Description
The aim of this monograph is to present some of the basic ideas and results in pure combinatory logic and their applications to some topics in proof theory, and also to present some work of my own. Some of the material in chapter 1 and 3 has already appeared in my notes Introduction to Combinatory Logic. It appears here in revised form since the presen tation in my notes is inaccurate in several respects. I would like to express my gratitude to Stig Kanger for his invalu able advice and encouragement and also for his assistance in a wide variety of matters concerned with my study in Uppsala. I am also in debted to Per Martin-USf for many valuable and instructive conversa tions. As will be seen in chapter 4 and 5, I also owe much to the work of Dag Prawitz and W. W. Tait. My thanks also to Craig McKay who read the manuscript and made valuable suggestions. I want, however, to emphasize that the shortcomings that no doubt can be found, are my sole responsibility. Uppsala, February 1972.
More details
Series
Edition
Softcover reprint of the original 1st ed. 1972
Language
English
Place of publication
Dordrecht
Netherlands
Target group
Professional and scholarly
Research
Illustrations
X, 177 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 11 mm
Weight
300 gr
ISBN-13
978-94-010-2915-5 (9789401029155)
DOI
10.1007/978-94-010-2913-1
Schweitzer Classification
Other editions
Additional editions
S. Stenlund
Combinators, ?-Terms and Proof Theory
E-Book
12/2012
Springer
€96.29
Available for download
S. Stenlund
Combinators, ?-Terms and Proof Theory
Book
09/1972
Kluwer Academic Publishers
€106.99
Shipment within 15-20 days
Content
1. The Theory of Combinators and the ?-Calculus.- 1. Introduction.- 2. Informal theory of combinators.- 3. Equality and reduction.- 4. The ?-calculus.- 5. Equivalence of the ?-calculus and the theory of combinators.- 6. Set-theoretical interpretations of combinators.- 7. Illative combinatory logic and the paradoxes.- 2. The Church-Rosser Property.- 1. Introduction.- 2. R-reductions.- 3. One-step reduction.- 4. Proof of main result.- 5. Generalization.- 6. Generalized weak reduction.- 3. Combinatory Arithmetic.- 1. Introduction.- 2. Combinatory definability.- 3. Fixed-points and numeral sequences.- 4. Undecidability results.- 4. Computable Functionals of Finite Type.- 1. Introduction.- 2. Finite types and terms of finite types.- 3. The equation calculus.- 4. The role of the induction rule.- 5. Soundness of the axioms.- 6. Defining axioms and uniqueness rules.- 7. Reduction rules.- 8. Computability and normal form.- 9. Interpretation of types and terms.- 5. Proofs in the Theory of Species.- 1. Introduction.- 2. Formulas, terms and types.- 3. A-terms and deductions.- 4. The equation calculus.- 5. Reduction and normal form.- 6. The strong normalization theorem.- 7. Interpretation of types and terms.- Index of Names.- Index of Subjects.