Talk:Well-Founded Induction

Am I correct in thinking that well-founded induction is the most general form of induction, or at least the most common general standard form? If so, we (I?) should probably undertake to prove the other forms from it. Also, I don't think we have well-founded recursive definition here. --Dfeuer (talk) 21:17, 24 December 2012 (UTC)


 * It appears so, yes. At least it incorporates ordinal, natural numbers and structural induction (which are the most common forms I've seen). However, this part of the site (set up by Asalmon last summer) is still quite a mess, with uncommendable notations and a partial attempt to use class theory. It needs a thorough reworking but I'm currently working in a twice-nested sub-thread (Awodey -> Halmos/Givant -> Lattice theory) so it will be quite a long time before I can go over it. Prime.mover doesn't like the field so it's unlikely he'll take it up.
 * Nonetheless, let such considerations not deter you from attempting to link the various induction theorems. Posting a recursion theorem in this generality would also be nice but I fear that the preliminaries are still a bit wobbly at the least, so it'll be a challenge. --Lord_Farin (talk) 21:27, 24 December 2012 (UTC)