Set Theory and Logic


Refutation of Formalization of Axiom of Choice and Equivalent Theorems Using the Coq Tool

Authors: Colin James III

We evaluate two definitions for maximum and minimal set membership, for the nesting of sets, and the equivalence relations of axiom of choice, Tukey’s lemma, Hausdorff maximal principle, maximal principle, Zermelo’s postulate, Zorn’s lemma, well-ordering theorem. None is tautologous, refuting the claims. The authors conclude: “The whole process of formal proof demonstrates that the Coq-based machine proving of mathematics theorem is highly reliable and rigorous. The formal work of this paper is enough for most applications, especially in set theory, topology and algebra.” We refute those assertions based on the non-bivalent performance of the Coq proof assistant. Therefore, these formalizations and methodology render a non tautologous fragment of the universal logic VŁ4.

Comments: Pages.

Download: PDF

Submission history

[v1] 2019-06-23 09:18:35

Unique-IP document downloads: 10 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus