/sci/ - Science & Math

Previous: >>9357587

Anyone know lambda calculus?

true = [math]\lambda t. \lambda f. t[/math]
fls = [math]\lambda t. \lambda f. f[/math]
Reduce the following lambda term: tru a b

Suppose the logical and operator was defined as the following: and = [math]\lambda b. \lambda c. b c fls[/math]
Reduce the term: and tru tru.

Need a perfect set and a compact set such that their intersection is NOT compact.

This is impossible, the intersection of two closed sets is closed (RIGHT???) and one of them (the compact one) must be bounded. So the intersection must be closed and bounded, methinks