◀ ▲ ▶Branches / Logic / Lemma: The Proving Principle by Transfinite Induction
Lemma: The Proving Principle by Transfinite Induction
The proving principle by transfinite induction is a valid logical argument in first order predicate logic. It consists of:
- the base case premise: $p(\alpha)$ for some ordinal number $\alpha,$
- the induction step premise: prove that $p(\beta)$ is true assuming that $p(\alpha)$ is true for all $\alpha\subset \beta,$
- the conclusion: $p(\beta)$ is true for all ordinal numbers $\beta$ greater than or equal the base case $\alpha.$
Table of Contents
Proofs: 1
Thank you to the contributors under CC BY-SA 4.0!
![](https://github.com/bookofproofs/bookofproofs.github.io/blob/main/_sources/_assets/images/calendar-black.png?raw=true)
- Github:
-
![bookofproofs](https://github.com/bookofproofs.png?size=32)
References
Bibliography
- Toenniessen, Fridtjof: "Topologie", Springer, 2017
Footnotes