Combinatory and propositional logic

Notre Dame Journal of Formal Logic 15 (1):156-160 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Propositional and predicate calculuses based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5:161.
A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
The completeness of combinatory logic with discriminators.John T. Kearns - 1973 - Notre Dame Journal of Formal Logic 14 (3):323-330.
$\Lambda$-elimination in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):628-630.
Scott's models and illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):609-612.
Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.
The Church Rosser theorem for strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (4):299-302.
Various systems of set theory based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (2):192-206.

Analytics

Added to PP
2010-08-24

Downloads
17 (#895,795)

6 months
8 (#415,703)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Positive logic and λ-constants.David Meredith - 1978 - Studia Logica 37 (3):269 - 285.

Add more citations

References found in this work

No references found.

Add more references