T. Coquand, A semantics of evidence for classical arithmetic, The Journal of Symbolic Logic, vol.54, issue.01, pp.325-337, 1995.
DOI : 10.1007/BFb0079691

M. Guillermo, Jeux de réalisabilité en arithmétique classique, 2008.

M. Guillermo and A. Miquel, Specifying Peirce's law in classical realizability, Mathematical Structures in Computer Science, vol.7, issue.07, 2011.
DOI : 10.1016/S0304-3975(02)00776-4

M. Guillermo, Miquey, Classical realizability and arithmetical formulae, Under revision abs/1403, p.875, 2014.

J. Krivine, Dependent choice, 'quote' and the clock, Th Realizability in classical logic. In interactive models of computation and program behaviour, Comp. Sc, vol.308, pp.259-276, 2003.

E. Miquey and ). , Team ?r 2 , INRIA, Laboratoire PPS, Université Paris-Diderot E-mail address: emiquey@pps