A Lightweight Double-negation Translation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

A Lightweight Double-negation Translation


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.
Fichier principal
Vignette du fichier
paper_36.pdf (370.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01245021 , version 1 (16-12-2015)


  • HAL Id : hal-01245021 , version 1


Frédéric Gilbert. A Lightweight Double-negation Translation. LPAR-20. 20th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Nov 2015, Suva, Fiji. ⟨hal-01245021⟩
355 View
294 Download


Gmail Facebook Twitter LinkedIn More