Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus

DOI10.1007/978-3-540-73001-9_41zbMath1150.03337OpenAlexW1574692083MaRDI QIDQ5425341

Kentaro Kikuchi

Publication date: 13 November 2007

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-73001-9_41

zbMATH Keywords

\(\lambda \)-calculusCut-eliminationExplicit substitutionConfluenceSequent calculus

Mathematics Subject Classification ID

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

Related Items (1)

Strong Normalisation of Cut-Elimination That Simulates β-Reduction

This page was built for publication: Confluence of Cut-Elimination Procedures for the Intuitionistic Sequent Calculus