Definition:Minimally Inductive Set/Definition 3
Definition
 | This page has been identified as a candidate for refactoring of advanced complexity. In particular: Based on Takeuti Until this has been finished, please leave {{Refactor}} in the code.
New contributors: Refactoring is a task which is expected to be undertaken by experienced editors only. Because of the underlying complexity of the work needed, it is recommended that you do not embark on a refactoring task until you have become familiar with the structural nature of pages of $\mathsf{Pr} \infty \mathsf{fWiki}$.To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Refactor}} from the code. |
The minimally inductive set $\omega$ is defined as:
- $\omega := \set {x \in \On: \paren {x \cup \set x} \subseteq K_I}$
where:
- $K_I$ is the class of all non-limit ordinals
- $\On$ is the class of all ordinals.
Nomenclature
The name minimally inductive set is borrowed from the concept of the minimally inductive class as introduced by Raymond M. Smullyan and Melvin Fitting in their Set Theory and the Continuum Problem.
Keith Devlin, in The Joy of Sets: Fundamentals of Contemporary Set Theory, refers to this object as the first infinite ordinal.
Paul Halmos raises the concept in his Naive Set Theory, but fails to pin a name to it.
The term minimal infinite successor set was invented by $\mathsf{Pr} \infty \mathsf{fWiki}$ in an attempt to provide a name consistent and compatible with Halmos's approach.
As such, it is not generally expected to be seen in this context outside $\mathsf{Pr} \infty \mathsf{fWiki}$.
Instances of this term have subsequently been replaced by minimally inductive set.
Also see
- Results about the minimally inductive set can be found here.
Sources
- 1971: Gaisi Takeuti and Wilson M. Zaring: Introduction to Axiomatic Set Theory: $7.28$