λμ-calculus and Böhm's theorem

Journal of Symbolic Logic 66 (1):407-413 (2001)
  Copy   BIBTEX

Abstract

The λμ-calculus is an extension of the λ-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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,551

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Non Deterministic Classical Logic: The -calculus.Karim Nour - 2002 - Mathematical Logic Quarterly 48 (3):357-366.
Storage operators and directed lambda-calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.
Call-by-name reduction and cut-elimination in classical logic.Kentaro Kikuchi - 2008 - Annals of Pure and Applied Logic 153 (1-3):38-65.
Typed lambda-calculus in classical Zermelo-Frænkel set theory.Jean-Louis Krivine - 2001 - Archive for Mathematical Logic 40 (3):189-205.
Towards a canonical classical natural deduction system.José Santo - 2013 - Annals of Pure and Applied Logic 164 (6):618-650.
The λ μ T -calculus.Herman Geuvers, Robbert Krebbers & James McKinna - 2013 - Annals of Pure and Applied Logic 164 (6):676-701.
A completeness result for the simply typed λμ-calculus.Karim Nour & Khelifa Saber - 2010 - Annals of Pure and Applied Logic 161 (1):109-118.
The Standardization Theorem for λ‐Calculus.Gerd Mitschke - 1979 - Mathematical Logic Quarterly 25 (1-2):29-31.

Analytics

Added to PP
2009-01-28

Downloads
122 (#178,257)

6 months
20 (#147,745)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references