English

Polarizing Double Negation Translations

Logic in Computer Science 2013-12-20 v1

Abstract

Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations. To achieve this, we consider the polarization of the formul{\ae}{} and adapt those translation to the different connectives and quantifiers. We show that the embedding results still hold, using a customized version of the focused classical sequent calculus. We also prove the latter equivalent to more usual versions of the sequent calculus. This polarization process allows lighter embeddings, and sheds some light on the relationship between intuitionistic and classical connectives.

Keywords

Cite

@article{arxiv.1312.5420,
  title  = {Polarizing Double Negation Translations},
  author = {Mélanie Boudard and Olivier Hermant},
  journal= {arXiv preprint arXiv:1312.5420},
  year   = {2013}
}
R2 v1 2026-06-22T02:31:14.129Z