Some new double induction and superinduction principles (Q751653)

Let U be a class, \(a_ 0\in U\), G: \(U\to U\), \({\mathcal D}\) a class of subsets of U, and \(\Psi: {\mathcal D}\to U\). A subclass B of U is said to be superinductive (with respect to \(a_ 0\), G, \({\mathcal D}\), \(\Psi\)) if \(a_ 0\in B\), B is closed under G, and \(D\subseteq B\Rightarrow \Psi (D)\in B\) for every \(D\in {\mathcal D}\). If a superinductive class B has no superinductive proper subclass, then B is said to be minimally superinductive. The principal result is the following Theorem B: Assume M is minimally superinductive with respect to \(a_ 0\), G, \({\mathcal D}\), \(\Psi\), and that R(x,y) is a relation on M satisfying the following conditions. \(D_ 1:\) \(R(x,a_ 0)\) for all x in M. \(D_ 2:\) For all x, y in M, if R(x,y) and R(y,x), then R(x,G(y)). \(D_ 3:\) For any x in M and any D in \({\mathcal D}\) such that \(D\subseteq M\), if R(x,y) holds for all y in D, then R(x,\(\Psi\) (D)). Then R(x,y) holds for all x and y in M. Now, assume that \(\leq\) is a partial order on U such that every linearly ordered subset of U has a least upper bound in U. Take \({\mathcal D}\) to be the class of linearly ordered subsets of U, and, for each D in \({\mathcal D}\), let \(\Psi\) (D) be the least upper bound of D. Moreover, assume \(x\leq G(x)\) for every x in u. Then, using Theorem B, the author proves that any class M that is minimally superinductive with respect to \(a_ 0\), G, \({\mathcal D}\), \(\Psi\) must be well-ordered under \(\leq\). This corollary is essentially a theorem of \textit{R. H. Cowen} [Notre Dame J. Formal Logic 12, 62-68 (1971; Zbl 0177.014)]. As in Cowen's paper, the author did not use the replacement axiom in the proof. Theorem B extends a result obtained previously by the author [Trans. New York Acad. Sci., II. Ser. 28, 175-185 (1965; Zbl 0309.02066)] that provides a uniform approach to the well-ordering principle, Zorn's lemma, the transfinite recursion theorem, and various properties of ordinal numbers.