Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
I put a bunch of stuff there that might be of interest to the logicians and foundationalists among us, although it’s still pretty trivial.
I think in type theory the “curried” definition of a binary function as a function whose codomain is a function type is at least as prevalent as having the domain a cartesian product. It’s certainly more convenient in some formalizations, like Coq (it avoids the need to “destruct” the ordered pair explicitly). One could even consider a judgment like
to define a binary function without reference to function types or product types. True, when type theory is used as a foundation for mathematics, one generally does include both product and function types, but arguably neither of them is necessary for a definition of “binary function”.
Yeah, I had started to write some stuff about type theory but took it out unfinished. All that’s left is the vague statement about axiomatising the concept instead of defining it. (That a judgement like your example is meaningful is due to a common principle that axiomatises -ary functions for all at once.)
1 to 3 of 3