arXiv (All)
open access
Formal Verification of Proofs from Automated Theorem Provers for Higher-Order Logic
We identify common challenges and requirements for verifying proofs from automated theorem provers in the Dedukti logical framework and develop a general methodology for deriving encodings of calculus rules and proof steps, including clausification. We then apply this methodology to the EP calculus
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Reasoning-Centric LLM-based Automated Theorem Proving#124126
- ProofPulse: Interactive Proof Coverage Analysis for Dafny#818862
- ProofPulse: Interactive Proof Coverage Analysis for Dafny#808870
- MathAdv: What Theorem Provers Know, Reason, Formalize, and Generalize#785228
- MathAdv: What Theorem Provers Know, Reason, Formalize, and Generalize#783637
Record · ID 1051004
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive