Strong normalization of a symmetric lambda calculus for second-order classical logic

DOI10.1007/S001530200007zbMath1022.03007OpenAlexW2092082919MaRDI QIDQ1407527

Yoriyuki Yamagata

Publication date: 16 September 2003

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

Full work available at URL: https://doi.org/10.1007/s001530200007

zbMATH Keywords

second-order logicstrong normalizabilityinfinitary propositional logicreducibility candidatessymmetric lambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

This page was built for publication: Strong normalization of a symmetric lambda calculus for second-order classical logic