On the equivalence of systems of rules and systems of axioms in illative combinatory logic

Notre Dame Journal of Formal Logic 20 (3):603-608 (1979)

Abstract

This article has no associated abstract. (fix it)

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,694

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-08-24

Downloads
7 (#1,075,374)

6 months
1 (#388,311)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references

Citations of this work

Add more citations

Similar books and articles

Pure Type Systems with More Liberal Rules.Martin Bunder & Wil Dekkers - 2001 - Journal of Symbolic Logic 66 (4):1561-1580.
Introduction to Combinatory Logic.J. Roger Hindley - 1972 - Cambridge University Press.
Consistency Notions in Illative Combinatory Logic.M. W. Bunder - 1977 - Journal of Symbolic Logic 42 (4):527-529.
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.
$\lambda$-Elimination in Illative Combinatory Logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):628-630.
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.