Analytic combinatory calculi and the elimination of transitivity

DOI10.1007/S00153-003-0203-1zbMath1060.03033OpenAlexW2149904043MaRDI QIDQ1879319

Pierluigi Minari

Publication date: 22 September 2004

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-003-0203-1

zbMATH Keywords

equational logictransitivityextensionalitycombinatory logic

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (3)

Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters ⋮ Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey ⋮ A solution to Curry and Hindley's problem on combinatory strong reduction

This page was built for publication: Analytic combinatory calculi and the elimination of transitivity