The Standardization Theorem for λ‐Calculus

Mathematical Logic Quarterly 25 (1-2):29-31 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19790250104

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

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

The Standardization Theorem for λ‐Calculus.Gerd Mitschke - 1979 - Mathematical Logic Quarterly 25 (1‐2):29-31.
λμ-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.
Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters. [REVIEW]Pierluigi Minari - 2007 - Archive for Mathematical Logic 46 (5-6):385-424.
The abstract variable-binding calculus.Don Pigozzi & Antonino Salibra - 1995 - Studia Logica 55 (1):129 - 179.
Theorem Proving and Model Building with the Calculus KE.Jeremy Pitt & Jim Cunningham - 1996 - Logic Journal of the IGPL 4 (1):129-150.
A finite model theorem for the propositional μ-calculus.Dexter Kozen - 1988 - Studia Logica 47 (3):233 - 241.
Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.
On some Classes of Heyting Algebras with Successor that have the Amalgamation Property.José L. Castiglioni & Hernán J. San Martín - 2012 - Studia Logica 100 (6):1255-1269.
Powerset residuated algebras and generalized Lambek calculus.Miroslawa Kolowska-Gawiejnowicz - 1997 - Mathematical Logic Quarterly 43 (1):60-72.
A proof of axiomatizability of łukasiewicz’s three-valued implicational propositional calculus.T. Prucnal - 1967 - Studia Logica 20 (1):144-144.
Storage operators and directed lambda-calculus.René David & Karim Nour - 1995 - Journal of Symbolic Logic 60 (4):1054-1086.
The philosophical significance of Cox's theorem.Mark Colyvan - unknown
Non-classical conditional probability and the quantum no-cloning theorem.Gerd Niestegge - unknown
A standardization theorem for strong reduction.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):271-283.

Analytics

Added to PP
2016-02-04

Downloads
30 (#517,657)

6 months
9 (#298,039)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Upper Bounds for Standardizations and an Application.Hongwei Xi - 1999 - Journal of Symbolic Logic 64 (1):291-303.

Add more citations

References found in this work

Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..

Add more references