{-# OPTIONS --cubical-compatible #-}
module Padova2025.ComputationalContent.DoubleNegation (⊥ : Set) where

Sarcastic interpretation of classical logic

open import Padova2025.ProvingBasics.Connectives.Disjunction
open import Padova2025.ProvingBasics.Connectives.More
open import Padova2025.ProgrammingBasics.Lists

infix  ¬_
¬_ : Set → Set  -- enter `¬` as `\neg`
¬ P = (P → ⊥)

return : {A : Set} → A → ¬ ¬ A
return = {!!}

⊥-elim : {A : Set} → ⊥ → ¬ ¬ A
⊥-elim = {!!}

escape : ¬ ¬ ⊥ → ⊥
escape = {!!}

oracle : {A : Set} → ¬ ¬ (A ⊎ ¬ A)
oracle = {!!}

infixl  _>>=_ _⟫=_

_>>=_ : {A B : Set} → ¬ ¬ A → (A → ¬ ¬ B) → ¬ ¬ B
_>>=_ = {!!}

_⟫=_ : {A B : Set} → ¬ ¬ A → (A → ¬ ¬ B) → ¬ ¬ B
_⟫=_ = _>>=_

liftA2 : {A B C : Set} → (A → B → C) → ¬ ¬ A → ¬ ¬ B → ¬ ¬ C
liftA2 = {!!}

sequence : {X : Set} {P : X → Set} {xs : List X} → All (λ x → ¬ ¬ P x) xs → ¬ ¬ All P xs
sequence = {!!}

The infinitary analogue of the sequence function is known as double-negation shift. It is not generally available in constructive mathematics. Already the countable version fails in general, that is, in Agda we cannot write down a value of type DNS:

open import Padova2025.ProgrammingBasics.Naturals.Base

DNS : Set₁
DNS = {P : ℕ → Set} → ((n : ℕ) → ¬ ¬ P n) → ¬ ¬ ((n : ℕ) → P n)

The assumption (n : ℕ) → ¬ ¬ P n expresses that, for each number n, somewhere in the platonic heaven there is a witness of P n, without disclosing or giving any way to find it. The conclusion ¬ ¬ ((n : ℕ) → P n) expresses that, somewhere in the platonic heaven, there is a function mapping natural numbers n to witnesses of P n. The double-negation shift principle expresses the conviction that it is possible to collect all these anonymous witnesses into a function. This fails, for instance, in the effective topos and in most sheaf toposes.