Metraipolis › archive › dc_45f1ec705cd9

Math Foundation Formalization Agent: A General-Purpose Approach to Formalizing Mathematical Foundations — arXiv:2611.02843

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02843
License (as archived)
CC0-1.0
Archived
2026-11-03T10:37:59.777Z
SHA-256 of the archived text
9dc45d7f5585947e2d3540aec221d46c0d29267dee5cd67a15fd9326915c6626
Stable URL of this page
https://metraipolis.com/documento/dc_45f1ec705cd9

How to cite

Math Foundation Formalization Agent: A General-Purpose Approach to Formalizing Mathematical Foundations — arXiv:2611.02843 — arXiv (en), https://arxiv.org/abs/2611.02843 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_45f1ec705cd9 (Metraipolis archive dc_45f1ec705cd9, sha256 9dc45d7f5585947e2d3540aec221d46c0d29267dee5cd67a15fd9326915c6626)
BibTeX
@misc{dc45f1ec705cd9,
  title = {Math Foundation Formalization Agent: A General-Purpose Approach to Formalizing Mathematical Foundations — arXiv:2611.02843},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02843},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_45f1ec705cd9; sha256 9dc45d7f5585947e2d3540aec221d46c0d29267dee5cd67a15fd9326915c6626},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02843. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Mathematical formalization plays an important role in establishing rigorous and machine-verifiable foundations for mathematical reasoning. With the development of large language models (LLMs) and interactive theorem provers, intelligent agents offer a promising approach to automating the formalization of mathematical theories. This paper presents the Math Foundation Formalization Agent (MFF-Agent), a general-purpose intelligent agent designed to support formalization tasks across multiple mathematical domains. The agent integrates the reasoning capabilities of large language models with the formal verification capabilities of the Rocq proof assistant. It incorporates task classification, tool-assisted execution, verification feedback, and state-based task management to support the generation, refinement, and verification of formal proofs. Unlike an approach focused on a single mathematical theory, the agent is examined through case studies involving Morse--Kelley axiomatic set theory (MK), real numbers, propositional logic, and equivalences of the axiom of choice. These cases investigate its applicability across mathematical foundations and distinguish source-level completion, interactive verification, and reproducible compilation. The results demonstrate the feasibility of a unified operational framework for heterogeneous foundation-level tasks and clarify the gap between such a framework and a fully integrated mathematical foundation.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.02843 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T10:29:48.907Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).