a normal form is any combinatory term in which the primitive combinators that occur, if any, are not applied to enough arguments to be simplified. it is undecidable whether a general combinatory term has a normal form; whether two combinatory terms are equivalent, etc. this is equivalent to the undecidability of the corresponding problems for lambda terms. however, a direct proof is as follows: