The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II

This second part of [13] takes up the showing in detail of the properties in [13, §3] for the proposed definitions of abstraction and combinatory β-reduction. The difficult cases are (R3) (the Church-Rosser Theorem) and (R6) on irreducible CL-terms.