On Equivalents of Well-foundedness - An experiment in Mizar

Four statements equivalent to well-foundedness (well-founded induction, existence of recursively deened functions, uniqueness of recursively deened functions , and absence of descending !-chains) have been proved in Mizar and the proofs mechanically checked for correctness. It seems not to be widely known that the existence (without the uniqueness assumption) of recursively deened functions implies well-foundedness. In the proof we used regular cardinals, a fairly advanced notion of set theory. The theory of cardinals in Mizar was developed earlier by G. Bancerek. With the current state of the Mizar system, the proofs turned out to be an exercise with only minor additions at the fundamental level. We would like to stress the importance of a systematic development of a mechanized data base for mathematics in the spirit of the QED Project.

[1]  The de l'Hospital Theorem , 1991 .

[2]  G. Bancerek.  On Powers of Cardinals , 1992 .

[3]  A. Trybulec.  Tarski Grothendieck Set Theory , 1990 .

[4]  Konrad Raczkowski.  Average Value Theorems for Real Functions of One Variable 1 , 1990 .

[5]  Zinaida Trybulec,et al.  Boolean Properties of Sets , 1990 .

[6]  Robert S. Boyer.  Panel Discussion: A Mechanically Proof-Checked Encyclopedia of Mathematics: Should We Build One? Can We? , 1994, CADE.

[7]  Grzegorz Bancerek,et al.  The Well Ordering Relations , 1990 .

[8]  John Harrison,et al.  A Mizar Mode for HOL , 1996, TPHOLs.

[9]  Yatsuka Nakamura,et al.  The Theorem of Weierstrass , 2007 .

[10]  Agata Darmochwa,et al.  Heine-Borel's Covering Theorem , 1991 .

[11]  Andrzej Trybulec,et al.  Function Domains and Frænkel Operator , 1990 .

[12]  Wojciech A. Trybulec.  Partially Ordered Sets , 1990 .

[13]  Jan Popio,et al.  Real Normed Space , 1991 .

[14]  Grzegorz Bancerek,et al.  Zermelo Theorem and Axiom of Choice , 1990 .

[15]  John Harrison,et al.  Inductive Definitions: Automation and Application , 1995, TPHOLs.

[16]  G. Bancerek,et al.  Ordinal Numbers , 2003 .

[17]  Andrzej Trybulec,et al.  Miscellaneous Facts about Functions , 1996 .

[18]  J. Grundy,et al.  Theorem proving in higher order logics : 9th International Conference, TPHOLsʾ96, Turku, Finland, August 26-30, 1996 : proceedings , 1996 .

[19]  Mariusz Żynel,et al.  The Steinitz Theorem and the Dimension of a Vector Space , 1995 .

[20]  Jaskowski,et al.  Polish Logic 1920-1939. , 1969 .

[21]  Alfred Tarski.  On well-ordered subsets of any set , 1939 .

[22]  G. Bancerek.  Countable Sets and Hessenberg's Theorem , 1991 .

[23]  Grzegorz Bancerek,et al.  Sequences of Ordinal Numbers , 1990 .

[24]  Leslie Lamport,et al.  How to Write a Proof , 1995 .

[25]  Wojciech A. Trybulec.  Subgroup and Cosets of Subgroups , 1990 .

[26]  Grzegorz Bancerek,et al.  Segments of Natural Numbers and Finite Sequences , 1990 .

[27]  Fred B. Schneider,et al.  A Logical Approach to Discrete Math , 1993, Texts and Monographs in Computer Science.

[28]  Kenneth Halpern August.  The Cardinal Numbers , 1888, Nature.

[29]  Alicia de la Cruz.  Fix Point Theorem for Compact Spaces , 1991 .

[30]  Katuzi Ono.  On a practical way of describing formal deductions , 1962 .

[31]  J. S. Walijewski,et al.  Representation Theorem for Boolean Algebras , 1993 .