Modified strong reduction in combinatory logic

Notre Dame Journal of Formal Logic 9 (3):265-270 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.
Combinatory reduction systems.Jan Willem Klop - 1980 - Amsterdam: Mathematisch centrum.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
Combinatory logic.Haskell Brooks Curry - 1958 - Amsterdam,: North-Holland Pub. Co..
A standardization theorem for strong reduction.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):271-283.
Compact bracket abstraction in combinatory logic.Sabine Broda & Luís Damas - 1997 - Journal of Symbolic Logic 62 (3):729-740.
The axiom of choice and combinatory logic.Andrea Cantini - 2003 - Journal of Symbolic Logic 68 (4):1091-1108.
Elements of combinatory logic.Frederic Brenton Fitch - 1974 - New Haven,: Yale University Press.
Introduction to combinatory logic.Sören Stenlund - 1971 - Uppsala,: Uppsala universitetet, Filosofiska föreningen och Filosofiska institutionen.

Analytics

Added to PP
2010-08-24

Downloads
8 (#1,321,089)

6 months
1 (#1,475,652)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references