5 ms·
You wrote that: forall f, x: f(x) = f(y) implies x = y What if f(x) is x^2 and f(y) is y^2? You could have x=2 and y=-2. I'm sure there is something I'm mi
by chris_wot 11y ago
You wrote that:
forall f, x: f(x) = f(y) implies x = y
What if f(x) is x^2 and f(y) is y^2? You could have x=2 and y=-2.
I'm sure there is something I'm missing, but wouldn't that make the proposition false? i.e. f(x) = f(y) is true, but x = y is false, thus true implies false is false
- Animats 11y agoThe key is "forall f". That is, this must hold for all functions. In a constructive world, the set of all functions is finite. There's an existing set of known functions on the object. Any new functions must be created using those functions, so if the known functions have that property, so must functions built from them. The key idea is that new functions can't look inside the object directly. Think private data and function members in C++. So two objects may have different internal representations, but if the exported functions won't let you distinguish them, you can treat them as equal.
- chris_wot 11y agoSo if the result of all values of x of the function f and g then the functions f and g are equivalent. Is that correct? If so, then does the theory handle encapsulation only?