Math 2.0

Mathematical logic and foundations Definition

Double-negation translation

Builds on Intuitionistic logicNegationPeano axiomsHeyting arithmeticLaw of excluded middle

Definition

Fix a first-order language, and read ¬A\neg A as A→⊥A \to \bot. The Gödel–Gentzen negative translation is the map A↦ANA \mapsto A^N on formulas defined by these clauses.

  1. ⊥N=⊥\bot^N = \bot, and PN=¬¬PP^N = \neg \neg P for every other atomic formula PP.
  2. (A∧B)N=AN∧BN(A \wedge B)^N = A^N \wedge B^N.
  3. (A∨B)N=¬(¬AN∧¬BN)(A \vee B)^N = \neg (\neg A^N \wedge \neg B^N).
  4. (A→B)N=AN→BN(A \to B)^N = A^N \to B^N.
  5. (∀x A)N=∀x AN(\forall x\, A)^N = \forall x\, A^N.
  6. (∃x A)N=¬∀x ¬AN(\exists x\, A)^N = \neg \forall x\, \neg A^N.

For a set of formulas Γ\Gamma, let ΓN={AN:A∈Γ}\Gamma^N = \set{A^N : A \in \Gamma}. Its main property is this: Γ⊢A\Gamma \vdash A in classical logic if and only if ΓN⊢AN\Gamma^N \vdash A^N in intuitionistic logic. A double-negation translation is any map with this property obtained by inserting double negations, such as the translations of Kolmogorov and Kuroda.

Remarks

Example: for the law of excluded middle with PP atomic, (P∨¬P)N=¬(¬¬¬P∧¬¬¬¬P)(P \vee \neg P)^N = \neg (\neg \neg \neg P \wedge \neg \neg \neg \neg P). Since ¬¬¬P\neg \neg \neg P is equivalent to ¬P\neg P in intuitionistic logic, this is equivalent to ¬(¬P∧¬¬P)\neg (\neg P \wedge \neg \neg P), which is intuitionistically provable. Non-example: the identity map A↦AA \mapsto A is not a double-negation translation, because P∨¬PP \vee \neg P is classically provable but not intuitionistically provable. For arithmetic, Peano arithmetic proves AA if and only if Heyting arithmetic proves ANA^N. In particular, if HA is consistent, then PA is consistent, because ⊥N=⊥\bot^N = \bot. In arithmetic, atomic formulas are equations, which are decidable in HA, so one may take PN=PP^N = P.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Intuitionistic logic concept
  2. Peano axioms concept
  3. Proposition concept
  4. Disjunction definition
  5. Negation definition
  6. Law of excluded middle statement
  7. Heyting arithmetic definition
  8. Double-negation translation definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Double-negation_translation
About this page
TagQEZR7PZ2DD
URIm2://QEZR7PZ2DD
Kinddefinition
WritingW0 stub
MSC03F25, 03F55, 03B20
DefinesDouble-negation translation
UsesIntuitionistic logic, Negation, Peano axioms, Heyting arithmetic, Law of excluded middle
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.