The Cut-Elimination Theorem for Differential Nets with Promotion

DOI10.1007/978-3-642-02273-9_17zbMath1246.03079OpenAlexW1483865853MaRDI QIDQ3637197

Michele Pagani

Publication date: 7 July 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-642-02273-9_17

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (5)

An introduction to differential linear logic: proof-nets, models and antiderivatives ⋮ The conservation theorem for differential nets ⋮ Realizability Proof for Normalization of Full Differential Linear Logic ⋮ Unnamed Item ⋮ Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms

Cites Work

• Linear logic
• Differential interaction nets
• The structure of multiplicatives
• Interpreting a Finitary Pi-calculus in Differential Interaction Nets
• Acyclicity and Coherence in Multiplicative Exponential Linear Logic

This page was built for publication: The Cut-Elimination Theorem for Differential Nets with Promotion