Formalization of Transfinite Induction in Coq
| Autor: | Tianyu Sun, Yaoshun Fu, Wensheng Yu |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
010401 analytical chemistry
Proof assistant 02 engineering and technology 021001 nanoscience & nanotechnology Mathematical proof 01 natural sciences Formal proof 0104 chemical sciences Minimum principle TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Transfinite induction TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Mathematical induction Calculus Set theory Algebra over a field 0210 nano-technology Mathematics |
| Zdroj: | 2019 Chinese Automation Congress (CAC). |
| Popis: | Transfinite induction is a proof method of mathematics and has important applications in computer science. In this paper, a formal proof of transfinite induction is proposed based on Morse-Kelley set theory. It is the first Coq formalization about transfinite induction to our knowledge. Furthermore, according to the minimum principle, we formally prove mathematical induction which is a special form on non-negative integers of transfinite induction. The whole proofs in this paper are verified in Coq proof assistant. The Morse-Kelley set theory is also formalized in Coq. The work shows that the formal proof of mathematical theorems is credible and religious. The formal work in this paper has important applications in set theory, algebra, and topology. In addition, according to transfinite induction, we can formally prove the general well-founded structures in computer science. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|