Illative combinatory logic without equality as a primitive predicate

DOI10.1305/NDJFL/1093883566zbMath0452.03008OpenAlexW2047188088MaRDI QIDQ1148305

Martin W. Bunder

Publication date: 1982

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093883566

zbMATH Keywords

illative combinatory logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (1)

A weak absolute consistency proof for some systems of illative combinatory logic

This page was built for publication: Illative combinatory logic without equality as a primitive predicate