$\lambda\mu$-Calculus and Bohm's Theorem
David, Rene ; Py, Walter
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 407-413 / Harvested from Project Euclid
The $\lambda\mu$-calculus is an extension of the $\lambda$-calculus that has been introduced by M Parigot to give an algorithmic content to classical proofs. We show that Bohm's theorem fails in this calculus.
Publié le : 2001-03-14
Classification: 
@article{1183746379,
     author = {David, Rene and Py, Walter},
     title = {$\lambda\mu$-Calculus and Bohm's Theorem},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 407-413},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746379}
}
David, Rene; Py, Walter. $\lambda\mu$-Calculus and Bohm's Theorem. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  407-413. http://gdmltest.u-ga.fr/item/1183746379/