Mirasyedioğlu, Şeref \(\lambda\)-Boolean theory. (English) Zbl 0656.03008 Int. Logic Rev. 35, 13-27 (1987). Based on standard bibliography the paper defines lambda-Boolean theory the terms of which are Boolean variables and constants and the if-then- else terms constructed over them. Lambda-Boolean functions serve (without being themselves terms) to create contractions and reductions of three kinds. Church-Rosser Theorem is proved for all these three kinds. Reviewer: P.Materna Cited in 2 Documents MSC: 03B40 Combinatory logic and lambda calculus Keywords:beta-reduction; beta-conversion; lambda-Boolean theory; Church-Rosser Theorem PDFBibTeX XMLCite \textit{Ş. Mirasyedioğlu}, Int. Logic Rev. 35, 13--27 (1987; Zbl 0656.03008)