An Isomorphism Between Cut-Elimination Procedure and Proof Reduction

DOI10.1007/978-3-540-73228-0_24zbMath1215.03067OpenAlexW1519014254MaRDI QIDQ3612641

Koji Nakazawa

Publication date: 10 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73228-0_24

Mathematics Subject Classification ID

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

Related Items (3)

Type checking and typability in domain-free lambda calculi ⋮ Strong normalization of classical natural deduction with disjunctions ⋮ Strong Normalisation of Cut-Elimination That Simulates β-Reduction

This page was built for publication: An Isomorphism Between Cut-Elimination Procedure and Proof Reduction