Preface Elements of combinatory logic Objects, combinators and terms Various kinds of combinators Reductions and combinatory bases Main theorems Church-Rosser property Normal forms and consistency Fixed points Second fixed point theorem and undecidability Recursive functions and arithmetic Primitive and partial recursive functions First modeling of partial recursive functions in CL Second modeling of partial recursive functions in CL Undecidability of weak equality Connections to l-calculi l-calculi: L Combinators in L Back and forth between CL and L (In)equational combinatory logic Inequational calculi Equational calculi Models Term models Operational models Encoding functions by numbers Domains Models for typed CL Relational models Dual and symmetric combinatory logics Dual combinators Symmetric combinators Structurally free logics Applied combinatory logic Illative combinatory logic Elimination of bound variables Typed combinatory logic Simply typed combinatory logic Intersection types for combinators Appendix Elements of combinatory logic Main theorems Recursive functions and arithmetic Connections to l-calculi (In)equational combinatory logic Models Dual and symmetric combinatory logic Applied combinatory logic Typed combinatory logic Bibliography List of Symbols Index >Operational models Encoding functions by numbers Domains Models for typed CL Relational models Dual and symmetric combinatory logics Dual combinators Symmetric combinators Structurally free logics Applied combinatory logic Illative combinatory logic Elimination of bound variables Typed combinatory logic Simply typed combinatory logic Intersection types for combinators Appendix Elements of combinatory logic Main theorems Recursive functions and arithmetic Connections to l-calculi (In)equational combinatory logic Models Dual and symmetric combinatory logic Applied combinatory logic Typed combinatory logic Bibliography List of Symbols Index p;lt;/P>.