English

Proof identity for mere mortals

Logic in Computer Science 2014-03-05 v1

Abstract

The proof identity problem asks: When are two proofs the same? The question naturally occurs when one reflects on mathematical practice. The problem understandably can be seen as a challenge for mathematical logic, and indeed various perspectives on the problem can be found in the proof theory literature. From the proof theory perspective, the challenge is met by laying down new calculi that eliminate ``bureaucracy''; techniques such as normalization and cut-elimination, as well as proof compression, are employed. In this note a new perspective on the proof identity problem is outlined. The new approach employs the concepts and tools of automated theorem proving and complements the rather more theoretical perspectives coming from pure proof theory. The practical approach is illustrated with experiments coming from the TPTP Problem Library.

Keywords

Cite

@article{arxiv.1403.0641,
  title  = {Proof identity for mere mortals},
  author = {Jesse Alama},
  journal= {arXiv preprint arXiv:1403.0641},
  year   = {2014}
}

Comments

10 pages. Submitted to the Mark Stickel Festschrift

R2 v1 2026-06-22T03:19:32.073Z