Scott's models and illative combinatory logic

Notre Dame Journal of Formal Logic 20 (3):609-612 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093882667

Other Versions

No versions found

Links

PhilArchive

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

A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
$\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.
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.
Significance and illative combinatory logics.M. W. Bunder - 1980 - Notre Dame Journal of Formal Logic 21 (2):380-384.
Combinatory and propositional logic.David Meredith - 1974 - Notre Dame Journal of Formal Logic 15 (1):156-160.
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.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.
The completeness of combinatory logic with discriminators.John T. Kearns - 1973 - Notre Dame Journal of Formal Logic 14 (3):323-330.
Modified strong reduction in combinatory logic.Kenneth Loewen - 1968 - Notre Dame Journal of Formal Logic 9 (3):265-270.

Analytics

Added to PP
2010-08-24

Downloads
80 (#711,448)

6 months
12 (#1,008,346)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Bunder’s paradox.Michael Caie - 2020 - Review of Symbolic Logic 13 (4):829-844.
Pure type systems with more liberal rules.Martin Bunder & Wil Dekkers - 2001 - Journal of Symbolic Logic 66 (4):1561-1580.

Add more citations

References found in this work

Propositional and predicate calculuses based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (1):25-34.
A deduction theorem for restricted generality.M. W. Bunder - 1973 - Notre Dame Journal of Formal Logic 14 (3):341-346.
Various systems of set theory based on combinatory logic.M. W. Bunder - 1974 - Notre Dame Journal of Formal Logic 15 (2):192-206.
Some notes on: "A deduction theorem for restricted generality".M. W. Bunder - 1976 - Notre Dame Journal of Formal Logic 17 (1):153-154.

Add more references