One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus (Q1104313)

A term in the \(\lambda\)-\(\beta\) calculus is said to be recurrent if every term reducible from it is reducible to it. A term is one-step recurrent if the result of any one step reduction of the term is reducible to the term. In these terms a conjecture of \textit{J. W. Klop} [Reduction cycles in combinatory logic: in: ``To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism'', 193-214 (1980; Zbl 0469.03006)] becomes: Every one step recurrent term is recurrent. The authors demonstrate the failure of the conjecture by giving a one-step recurrent term which is not recurrent. In addition they obtain a necessary and sufficient condition for a one-step recurrent term to be recurrent.