The mix rule

DOI10.1017/S0960129500000451zbMath0810.03004OpenAlexW2120950381MaRDI QIDQ4302338

A. Fleury, Christian Retoré

Publication date: 14 August 1994

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129500000451

zbMATH Keywords

sequent calculusproof netsmultiplicative linear logic with unitssequential proof

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Structure of proofs (03F07) Theories (e.g., algebraic theories), structure, and semantics (18C10) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (14)

The shuffle Hopf algebra and noncommutative full completeness ⋮ Softness of MALL proof-structures and a correctness criterion with Mix ⋮ MELL in the calculus of structures ⋮ An Analytic Propositional Proof System on Graphs ⋮ Natural deduction and coherence for weakly distributive categories ⋮ Debits and Credits in Petri Nets and Linear Logic ⋮ Unnamed Item ⋮ Handsome proof-nets: Perfect matchings and cographs ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Free modal Riesz spaces are Archimedean: a syntactic proof ⋮ Weakly distributive categories ⋮ System NEL is Undecidable ⋮ Relating Toy Models of Quantum Computation: Comprehension, Complementarity and Dagger Mix Autonomous Categories ⋮ Pomset Logic

Cites Work

• Linear logic
• Computational interpretations of linear logic

This page was built for publication: The mix rule