In mathematical logic, the Scott–Curry theorem is a result in lambda calculus stating that if two non-empty sets of lambda terms A and B are closed under beta-convertibility then they are recursively inseparable.
[1] A set A of lambda terms is closed under beta-convertibility if for any lambda terms X and Y, if
Two sets A and B of natural numbers are recursively separable if there exists a computable function
Two sets of lambda terms are recursively separable if their corresponding sets under a Gödel numbering are recursively separable, and recursively inseparable otherwise.
The Scott–Curry theorem applies equally to sets of terms in combinatory logic with weak equality.
It has parallels to Rice's theorem in computability theorem, which states that all non-trivial semantic properties of programs are undecidable.
The theorem has the immediate consequence that it is an undecidable problem to determine if two lambda terms are β-equivalent.
The proof is adapted from Barendregt in The Lambda Calculus.
[2] Let A and B be closed under beta-convertibility and let a and b be lambda term representations of elements from A and B respectively.
Suppose for a contradiction that f is a lambda term representing a computable function such that
(where equality is β-equality).
}}\ (fx))ab}
is true if its argument is zero and false otherwise, and
is equal to x if b is true and y if b is false.
By the Second Recursion Theorem, there is a term X which is equal to f applied to the Church numeral of its Gödel numbering, X'.
The reverse assumption
Either way we arise at a contradiction, and so f cannot be a function which separates A and B.
Hence A and B are recursively inseparable.
Dana Scott first proved the theorem in 1963.
The theorem, in a slightly less general form, was independently proven by Haskell Curry.
[3] It was published in Curry's 1969 paper "The undecidability of λK-conversion".