Escape to Mizar from ATPs

9 pages•Published: August 19, 2013

Abstract

We announce a tool for mapping derivations produced by 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).

Keyphrases: automated reasoning, automated theorem proving, interactive theorem proving, mizar, natural deduction, proof transformation, resolution

In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 3-11.

Links:	https://easychair.org/publications/paper/wBpw
	https://doi.org/10.29007/s1ts

BibTeX entry

@inproceedings{PAAR-2012:Escape_Mizar_from_ATPs,
  author    = {Jesse Alama},
  title     = {Escape to Mizar from ATPs},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/wBpw},
  doi       = {10.29007/s1ts},
  pages     = {3-11},
  year      = {2013}}

Download PDF Open PDF in browser