English

Escape to Mizar for ATPs

Logic in Computer Science 2012-05-02 v2

Abstract

We announce a tool for mapping derivations of the E theorem prover to Mizar proofs. Our mapping complements earlier work that generates problems for automated theorem provers from Mizar inference checking problems. We describe the tool, explain the mapping, and show how we solved some of the difficulties that arise in mapping proofs between different logical formalisms, even when they are based on the same notion of logical consequence, as Mizar and E are (namely, first-order classical logic with identity).

Keywords

Cite

@article{arxiv.1204.6615,
  title  = {Escape to Mizar for ATPs},
  author = {Jesse Alama},
  journal= {arXiv preprint arXiv:1204.6615},
  year   = {2012}
}

Comments

10 pages. Submitted to PAAR 2012 (Practical Aspects of Automated Reasoning, Manchester, June 2012, http://www.eprover.org/EVENTS/PAAR-2012.html)

R2 v1 2026-06-21T20:56:33.348Z