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. == Explanation == A set A of lambda terms is closed under beta-convertibility if for any lambda terms X and Y, if X ∈ A {\displaystyle X\in A} and X is β-equivalent to Y then Y ∈ A {\displaystyle Y\in A} .
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. == Explanation == A set A of lambda terms is closed under beta-convertibility if for any lambda terms X and Y, if X ∈ A {\displaystyle X\in A} and X is β-equivalent to Y then Y ∈ A {\displaystyle Y\in A} .
Source: Wikipedia "Scott–Curry theorem" · CC BY-SA 4.0
Share this article: X · Bluesky