Some results on numerical systems in \(\lambda\)-calculus

DOI10.1305/ndjfl/1040408610zbMath0830.03004OpenAlexW1978304975MaRDI QIDQ1903129

Benedetto Intrigila

Publication date: 30 January 1996

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

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

zbMATH Keywords

unsolvabilitynumeral systems\(\lambda \beta \eta\)-calculusnonconvertibility

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (2)

Recursion-free modular arithmetic in the lambda-calculus ⋮ Taming the wild ant-lion; a counterexample to a conjecture of Böhm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The ant-lion paradigm for strong normalization
• Combinatory logic. Vol. II
• Theoretical Pearls

This page was built for publication: Some results on numerical systems in \(\lambda\)-calculus