Description: Define a recursive
definition generator on (the class of ordinal
numbers) with characteristic function and initial value .
This combines functions in tfr1 2962 and in tz7.44-1 2966 into one
definition. This rather amazing operation allows us to define, with
compact direct definitions, functions that are usually defined in
textbooks only with indirect self-referencing recursive definitions. A
recursive definition requires advanced metalogic to justify - in
particular, eliminating a recursive definition is very difficult and
often not even shown in textbooks. On the other hand, the elimination
of a direct definition is a matter of simple mechanical substitution.
The price paid is the mind-boggling complexity of our operation.
But once we get past this hurdle, otherwise recursive definitions become
relatively simple, as in, for example, df-aleph 3624. From the direct
definition we can prove textbook recursive definitions as theorems using
rdgzer 2979, rdgsuc 2980, and rdglim 2981. We can also restrict the
operation to define otherwise recursive functions on the natural numbers
; see frzer 2990 and frsuc 2991. Our operation apparently
does not appear in published literature, although closely related is
Definition 25.2 of [Quine] p. 177, which
he uses to "turn...a recursion
into a genuine or direct definition" (p. 174). Note that the
operator (see df-if 1777) selects cases based on whether is zero,
has a limit ordinal domain, or has a successor
domain. |