3 ms·
> epsilon set N, s.t. N is the minimal set s.t. an element zero exists in N and there exists a function succ in the set N -> N, this is recursive, which is jus
by wastewaste 9y ago
> epsilon set N, s.t. N is the minimal set s.t. an element zero exists in N and there exists a function succ in the set N -> N,
this is recursive, which is just how a function like succ works (with a bit more work, anyway) but the definition rather concernes a polymorph function.
You do work in a particular encoding when you mention yero, at least. and succ^x is also an encoding (where x is zero or succ^y, where y is zero or ...).
- pron 9y ago> You do work in a particular encoding when you mention yero, at least. That encoding is completely opaque, though. You have no way of knowing what are the members of zero.