Non deterministic classical logic: the $lambdamu^{++}$-calculus

Mathematical Logic Quarterly 48 (3):357-366 (2002)
  Copy   BIBTEX

Abstract

In this paper, we present an extension of $lambdamu$-calculus called $lambdamu^{++}$-calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel-or

Categories

Keywords

Reprint years

DOI

10.1002/1521-3870(200204)48:3<357::aid-malq357>3.0.co;2-l

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,100

External links

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

Through your library

My notes

Similar books and articles

Non Deterministic Classical Logic: The λμ++ ‐calculus.Karim Nour - 2002 - Mathematical Logic Quarterly 48 (3):357-366.
$lambdamu$-Calculus and Bohm's Theorem.Rene David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
La valeur d'un entier classique en $\lambda\mu$ -calcul.Karim Nour - 1997 - Archive for Mathematical Logic 36 (6):461-473.
A General Type for Storage Operators.Karim Nour - 1995 - Mathematical Logic Quarterly 41 (4):505-514.
Strong storage operators and data types.Karim Nour - 1995 - Archive for Mathematical Logic 34 (1):65-78.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
Review: V. A. Jankov, On the Extension of the Intuitionist Propositional Calculus to the Classical Calculus, and the Minimal Calculus to the Intuitionist Calculus. [REVIEW]J. G. Anderson - 1973 - Journal of Symbolic Logic 38 (2):331-332.
Opérateurs de mise en mémoire et traduction de Gödel.Jean-Louis Krivine - 1990 - Archive for Mathematical Logic 30 (4):241-267.
A completeness result for the simply typed λμ-calculus.Karim Nour & Khelifa Saber - 2010 - Annals of Pure and Applied Logic 161 (1):109-118.
λμ-calculus and Böhm's theorem.René David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
Relational Semantics of the Lambek Calculus Extended with Classical Propositional Logic.Michael Kaminski & Nissim Francez - 2014 - Studia Logica 102 (3):479-497.
The modal object calculus and its interpretation.Edward N. Zalta - 1997 - In M. de Rijke (ed.), Advances in Intensional Logic. Kluwer Academic Publishers. pp. 249--279.
A reduction rule for Peirce formula.Sachio Hirokawa, Yuichi Komori & Izumi Takeuti - 1996 - Studia Logica 56 (3):419 - 426.

Analytics

Added to PP
2013-12-23

Downloads
15 (#949,647)

6 months
1 (#1,475,085)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references