negative translation
It is well-known that classical propositional logic PLc can be considered as a subsystem of intuitionistic propositional logic PLi by translating any wff A in PLc into ¬¬A in PLi. According to Glivenko’s theorem
, A is a theorem of PLc iff ¬¬A is a theorem of PLi. This translation, however, fails to preserve theoremhood in the corresponding predicate logics. For example, if A is of the form ∃xB, then ⊢cA no longer implies ⊢i¬¬A. A number of translations have been devised to overcome this defect. They are collective known as negative translations or double negative translations of classical logic into intuitionistic logic
. Below is a list of the most commonly mentioned negative translations:
-
•
Kolmogorov negative translation:
-
(a)
p∘:=¬¬p with p atomic and ⟂
-
(b)
-
(c)
-
(d)
-
(e)
-
(f)
-
(a)
-
•
Godël negative translation:
-
(a)
with atomic and
-
(b)
-
(c)
-
(d)
-
(e)
-
(f)
-
(a)
-
•
Kuroda negative translation:
-
(a)
with atomic and
-
(b)
-
(c)
-
(d)
-
(e)
-
(f)
And then .
-
(a)
-
•
Krivine negative translation:
-
(a)
with atomic and
-
(b)
-
(c)
-
(d)
-
(e)
-
(f)
And then .
-
(a)
Remark. It can be shown that for any wff :
where .
Title | negative translation |
Canonical name | NegativeTranslation |
Date of creation | 2013-03-22 19:35:48 |
Last modified on | 2013-03-22 19:35:48 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 9 |
Author | CWoo (3771) |
Entry type | Definition |
Classification | msc 03B20 |
Classification | msc 03F55 |
Synonym | double negative translation |
Defines | Kolmogorov negative translation |
Defines | Godel negative translation |
Defines | Kuroda negative translation |
Defines | Krivine negative translation |
\@unrecurse |