Proof nets for PiL

DOI10.1007/978-3-032-32592-1_4MaRDI QIDQ7411295zbMATH OpenFDO

Authors Matteo Acclavio, Giulia Manara

Publication date 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-32592-1_4

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A calculus of communicating systems
• A new approach to abstract syntax with variable binding
• A System of Interaction and Structure II: The Need for Deep Inference
• BV and Pomset Logic Are Not the Same
• Combinatorial proofs and decomposition theorems for first-order logic
• Conflict nets
• Generalized connectives for multiplicative linear logic
• Handsome proof-nets: Perfect matchings and cographs
• scientific article; zbMATH DE number 937366 (Why is no real title available?)
• Interpolation as cut-introduction: on the computational content of Craig-Lyndon interpolation
• Linear logic
• Nominal logic, a first order theory of names and binding
• Non-commutative logic. I: The multiplicative fragment
• Non-contractive logics, paradoxes, and multiplicative quantifiers
• On the meaning of logical rules. II: Multiplicatives and additives
• Pomset logic. The other approach to noncommutativity in logic
• Proof nets for first-order additive linear logic
• Proof nets for unit-free multiplicative-additive linear logic
• Quantales and (noncommutative) linear logic
• Subnets of proof-nets in multiplicative linear logic with MIX
• The structure of multiplicatives
• Unification nets: canonical proof net quantifiers

This page was built for publication: Proof nets for PiL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411295)