A Lightweight Double-negation Translation

13 pages•Published: December 18, 2015

Abstract

Deciding whether a classical theorem can be proved constructively is a well-known undecidable problem. As a consequence, any computable double-negation translation inserts some unnecessary double negations. This paper shows that most of these unnecessary insertions can be avoided without any use of constructive proof search techniques. For this purpose, we restrict the analysis to syntax-directed double-negation translations, which translate a proposition through a single traversal -- and include most of the usual translations such as Kolmogorov's, Gödel-Gentzen's, and Kuroda's. A partial order among translations are presented to select translations avoiding as many double negations as possible. This order admits a unique minimal syntax-directed translation with noticeable properties.

Keyphrases: classical logic, constructive logic, double negation translation, first order logic

In: Ansgar Fehnker, Annabelle McIver, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations, vol 35, pages 81-93.

Links:	https://easychair.org/publications/paper/ClHb
	https://doi.org/10.29007/vbs5

BibTeX entry

@inproceedings{LPAR-20:Lightweight_Double_negation_Translation,
  author    = {Frederic Gilbert},
  title     = {A Lightweight Double-negation Translation},
  booktitle = {LPAR-20. 20th International Conferences on Logic for Programming, Artificial Intelligence and Reasoning - Short Presentations},
  editor    = {Ansgar Fehnker and Annabelle McIver and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {35},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/ClHb},
  doi       = {10.29007/vbs5},
  pages     = {81-93},
  year      = {2015}}

Download PDF Open PDF in browser