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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,148

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

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.
$\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.
Constructive Set Theoretic Models of Typed Combinatory Logic.Andreas Knobel - 1993 - Journal of Symbolic Logic 58 (1):99-118.
Introduction to Combinatory Logic.J. Roger Hindley - 1972 - Cambridge University Press.

Analytics

Added to PP
2010-08-24

Downloads
10 (#881,206)

6 months
7 (#107,545)

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

No references found.

Add more references