[Agda] Double Negation as Monad

[Nils Anders Danielsson]

On 2009-10-29 17:22, Vag Vagoff wrote:
> If constructive mathematics is equivalent to classic one without double
> negation elimination law (from wich law of Excluded Middle is derivable)
> then constructive mathematics is strictly as  powerful as classic because
> simple algorithm may be created which converts classic proofs to
> constructive ones automatically using proof continuations and double
> negation monad (but converted proof will be surrounded by double negation).
>
> Is this correct?

You may be interested in the following talk slides:

  How to Understand What Classical Mathematicians Say
  Russell O'Connor
  http://www.cs.ru.nl/~spitters/completeness.html#OConnor

--
/NAD

This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.