Yeah I'm actually taking fucking crazy pills none of this shit makes any goddamn sense they say that for all elements of a well order you can plug a function inside itself as long as it will terminate and that's transinite induction but that doesn't fucking work if the well order is infinite. It'll terminate for any particular element, but there no end to the elements
How does one define recursion in the context of wff in ZFC? Seems impossible, but simultaneously necessary. If we can't define recursion, we can't define addition, but no wff can be infinite, so no one formula can deal with the infinite natural numbers
I thought I could use Replacement, but you need to pick a particular instance of Replacement to work with all natural numbers, but thatbdoesnt work when the natural numbers are infinitr
Describing the number 2 like there exists a z there exists a y there exists an x x in y and forall k k notin x and forall j j = x or j not in y and forall i i = x or i = y or i not in z
@Ukko it's the smallest set with the property that 0 < 1 < 2, which is done with \in. 0 is defined as {}, and all other numbers are defined recursively as x U {x}.
It's the second smallest element of the smallest inductive set.
somebody gave me too many nuts for christmas
this is not a shitpost it's like 10 pounds of nuts
what am I supposed to do with all these nuts :niggaabyss:
