> **get-second** was our function for extracting the second element of an ordered pair: `\fst snd. snd`. Compare this to our definition of **false**.
-> **ω** is defined to be: `\x. x x (\x. x x)`
+> **ω** is defined to be: `\x. x x`
It's possible to build a logical system equally powerful as the lambda calculus (and readily intertranslatable with it) using just combinators, considered as atomic operations. Such a language doesn't have any variables in it: not just no free variables, but no variables at all.
For instance, Szabolcsi argues that reflexive pronouns are argument
duplicators.
+![test](http://lambda.jimpryor.net/szabolcsi-reflexive.jpg)
![Szabolcsi's analysis of *himself* as the duplicator combinator](szabolcsi-reflexive.jpg)