Illative combinatory logic without equality as a primitive predicate

Notre Dame Journal of Formal Logic 23 (1):62-70 (1982)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093883566

Links

PhilArchive



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

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

Arithmetic based on the church numerals in illative combinatory logic.M. W. Bunder - 1988 - Studia Logica 47 (2):129 - 143.
Completeness of the propositions-as-types interpretation of intuitionistic logic into illative combinatory logic.Wil Dekkers, Martin Bunder & Henk Barendregt - 1998 - Journal of Symbolic Logic 63 (3):869-890.
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
On adding (ΞΎ) to weak equality in combinatory logic.Martin W. Bunder, J. Roger Hindley & Jonathan P. Seldin - 1989 - Journal of Symbolic Logic 54 (2):590-607.
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.
A weak absolute consistency proof for some systems of illative combinatory logic.M. W. Bunder - 1983 - Journal of Symbolic Logic 48 (3):771-776.
Significance and illative combinatory logics.M. W. Bunder - 1980 - Notre Dame Journal of Formal Logic 21 (2):380-384.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
Some consistency proofs and a characterization of inconsistency proofs in illative combinatory logic.M. W. Bunder - 1987 - Journal of Symbolic Logic 52 (1):89-110.
On the equivalence of systems of rules and systems of axioms in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):603-608.
Equivalences between Pure Type Systems and Systems of Illative Combinatory Logic.M. W. Bunder & W. J. M. Dekkers - 2005 - Notre Dame Journal of Formal Logic 46 (2):181-205.
Propositional and predicate calculuses based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.

Analytics

Added to PP
2010-08-24

Downloads
50 (#315,913)

6 months
8 (#351,349)

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