Notre Dame Journal of Formal Logic

Illative combinatory logic without equality as a primitive predicate.

M. W. Bunder

Full-text: Open access

Article information

Source
Notre Dame J. Formal Logic Volume 23, Number 1 (1982), 62-70.

Dates
First available in Project Euclid: 30 August 2004

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1093883566

Digital Object Identifier
doi:10.1305/ndjfl/1093883566

Mathematical Reviews number (MathSciNet)
MR634744

Zentralblatt MATH identifier
0452.03008

Subjects
Primary: 03B40: Combinatory logic and lambda-calculus [See also 68N18]

Citation

Bunder, M. W. Illative combinatory logic without equality as a primitive predicate. Notre Dame J. Formal Logic 23 (1982), no. 1, 62--70. doi:10.1305/ndjfl/1093883566. https://projecteuclid.org/euclid.ndjfl/1093883566


Export citation