Classical Cut - elimination in the π - calculus ( In memory of

We define the calculus LK a variant of the calculus X that enjoys the Curry-Howard correspondence for Gentzen’s calculus lk; the variant consists of allowing arbitrary progress of cut over cut. We study the π-calculus enriched with pairing, for which we define a notion of implicative type assignment. We translate the terms of LK into this variant of π, and show that reduction and assignable types are preserved. This implies that all proofs in lk have a representation in π, and that cut-elimination is effectively simulated by π’s synchronisation, congruence, and bisimilarity between processes. We present two interpretations for which we show soundness results (but with respect to different notions of reduction), as well as type preservation. Using the second interpretation, we show that we preserve Gentzen’s Hauptsatz result, and prove completeness. We then enrich the logic with the connector ¬ (negation), and show that this also can be represented in π, whilst preserving the results. keywords: classical logic, sequent calculus, pi calculus, translation, type assignment