Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

A variant of the double-negation translation Jeremy Avigad

Summary: A variant of the double-negation translation
Jeremy Avigad
August 23, 2006
An efficient variant of the double-negation translation explains the
relationship between Shoenfield's and G¨odel's versions of the Dialectica
Fix a classical first-order language, based on the connectives , , ¬, and
. We will define a translation to intuitionistic (even minimal) logic, based
on the usual connectives. The translation maps each formula to the formula

= ¬, so is supposed to represent an intuitionistic version of the negation
of . The map from to is defined recursively, as follows:
= ¬, when is atomic
(¬) = ¬
( ) =
( ) =
(x ) = x
Note that we can eliminate either or and retain a complete set of connectives.
If is the set of classical formulas {1, . . . , k}, let


Source: Avigad, Jeremy - Departments of Mathematical Sciences & Philosophy, Carnegie Mellon University


Collections: Multidisciplinary Databases and Resources; Mathematics