On the λY calculus

Annals of Pure and Applied Logic 130 (1-3):325-337 (2004)
  Copy   BIBTEX

Abstract

The λY calculus is the simply typed λ calculus augmented with the fixed point operators. We show three results about λY: the word problem is undecidable, weak normalisability is decidable, and higher type fixed point operators are not definable from fixed point operators at smaller types

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2004.04.004

Links

PhilArchive



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

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

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.
λμ-calculus and Böhm's theorem.René David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
$lambdamu$-Calculus and Bohm's Theorem.Rene David & Walter Py - 2001 - Journal of Symbolic Logic 66 (1):407-413.
The Situation Calculus: A Case for Modal Logic. [REVIEW]Gerhard Lakemeyer - 2010 - Journal of Logic, Language and Information 19 (4):431-450.
Valuation Semantics for Intuitionic Propositional Calculus and some of its Subcalculi.Andréa Loparić - 2010 - Principia: An International Journal of Epistemology 14 (1):125-33.
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.
Inferentializing consequence.Jaroslav Peregrin - unknown
Completeness of quantum logic.E. -W. Stachow - 1976 - Journal of Philosophical Logic 5 (2):237 - 280.
Varieties of linear calculi.Sara Negri - 2002 - Journal of Philosophical Logic 31 (6):569-590.
Non deterministic classical logic: the $lambdamu^{++}$-calculus.Karim Nour - 2002 - Mathematical Logic Quarterly 48 (3):357-366.
On reduction systems equivalent to the Lambek calculus with the empty string.Wojciech Zielonka - 2002 - Studia Logica 71 (1):31-46.
Itô’s Lemma with Quantum Calculus : Some Implications. [REVIEW]Emmanuel Haven - 2011 - Foundations of Physics 41 (3):529-537.
A Speech Act Calculus. A Pragmatised Natural Deduction Calculus and its Meta-theory.Moritz Cordes & Friedrich Reinmuth - manuscript

Analytics

Added to PP
2014-01-16

Downloads
10 (#1,198,690)

6 months
3 (#984,770)

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

Edinburgh LCF: a mechanised logic of computation.Michael J. C. Gordon - 1979 - New York: Springer Verlag. Edited by R. Milner & Christopher P. Wadsworth.
Completeness, invariance and λ-definability.R. Statman - 1982 - Journal of Symbolic Logic 47 (1):17-26.

Add more references