A deduction theorem for restricted generality

DOI10.1305/NDJFL/1093890997zbMath0197.28204OpenAlexW2063377490MaRDI QIDQ2539865

Martin W. Bunder

Publication date: 1973

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

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

zbMATH Keywords

recursion theory, constructive mathematics

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Systems of illative combinatory logic complete for first-order propositional and predicate calculus ⋮ Predicate calculus of arbitrarily high finite order ⋮ Equivalences between pure type systems and systems of illative combinatory logic

This page was built for publication: A deduction theorem for restricted generality