Timeline for Formalization of n-ary functions
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 25, 2011 at 18:24 | vote | accept | user16709 | ||
| Jul 25, 2011 at 18:23 | comment | added | user16709 | Also, if $f$ really is unary, this definition boils down to the usual. Awesome! | |
| Jul 25, 2011 at 18:16 | comment | added | user16709 | Thanks for the answer. I like the way in which you define tuples. I been born and raised to defined $n+1$-tuples as $(a_1, a_2, \dots, a_{n+1}) = (a_1, (a_2, \dots, a_{n_1}))$, so thinking of treating them differently didn't really enter my head. If tuples are defined as you show, then $f$ doesn't just "feel", $n$-ary, I think it can truly be called $n$-ary. | |
| Jul 25, 2011 at 7:39 | history | answered | Andreas Blass | CC BY-SA 3.0 |