An intuitionistic logic that proves Markov's principle - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

An intuitionistic logic that proves Markov's principle

Abstract

We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov's principle suited for predicate logic. At the computational level, the extraction of an existential witness out of a proof of its double negation is done by using a form of statically-bound exception mechanism, what can be seen as a direct-style variant of Friedman's A-translation.
Fichier principal
Vignette du fichier
herbelin.LICS2010.pdf (118.24 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

inria-00481815 , version 1 (07-05-2010)

Identifiers

  • HAL Id : inria-00481815 , version 1

Cite

Hugo Herbelin. An intuitionistic logic that proves Markov's principle. Logic In Computer Science, Jul 2010, Edinburgh, United Kingdom. pp.50-56. ⟨inria-00481815⟩
174 View
199 Download

Share

Gmail Mastodon Facebook X LinkedIn More