Non decomposable connectives of linear logic

DOI10.1016/j.apal.2019.05.006OpenAlexW2946847184MaRDI QIDQ2326414

Roberto Maieli

Publication date: 7 October 2019

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2019.05.006

zbMATH Keywords

sequent calculuslinear logicproof netspartitions sets

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items

An Analytic Propositional Proof System on Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Weakly distributive categories
• The structure of multiplicatives
• Modularity of proof-nets. Generating the type of a module.
• Focussing and proof construction
• A semantic characterisation of the correctness of a proof net
• A new correctness criterion for MLL proof nets