$\Lambda$-elimination in illative combinatory logic

Notre Dame Journal of Formal Logic 20 (3):628-630 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

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

A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
Scott's models and illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):609-612.
Illative combinatory logic without equality as a primitive predicate.M. W. Bunder - 1982 - Notre Dame Journal of Formal Logic 23 (1):62-70.
Significance and illative combinatory logics.M. W. Bunder - 1980 - Notre Dame Journal of Formal Logic 21 (2):380-384.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.
Combinatory and propositional logic.David Meredith - 1974 - Notre Dame Journal of Formal Logic 15 (1):156-160.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5:161.

Analytics

Added to PP
2010-08-24

Downloads
45 (#363,753)

6 months
6 (#587,779)

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