Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2002/iii/paper-76/3/i/solution

An easy lambda term must be equatable consistently with every closed lambda term. Choose the proposed equation . Applying it to gives . Applying that equation to an arbitrary closed gives . In particular the two Church Booleans become equal; then applying them to arbitrary gives . The extended equational theory is trivial, hence inconsistent in the required sense. Therefore is not easy.

New to topics? Read the docs here!