Non decomposable connectives of linear logic

DOI10.1016/J.APAL.2019.05.006MaRDI QIDQ2326414zbMATH OpenOpenAlexFDO

Authors 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

linear logicpartitions setsproof netssequent calculus

Mathematics Subject Classification ID

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

Cites work

• A new correctness criterion for MLL proof nets
• A semantic characterisation of the correctness of a proof net
• Focussing and proof construction
• scientific article; zbMATH DE number 4091500 (Why is no real title available?)
• scientific article; zbMATH DE number 1296290 (Why is no real title available?)
• scientific article; zbMATH DE number 1342251 (Why is no real title available?)
• Linear logic
• Modularity of proof-nets. Generating the type of a module.
• The blind spot. Course in logic. I. On the perfection
• The structure of multiplicatives
• Weakly distributive categories

Cited in

(4)

• Decidability and complexity of fibred logics without shared connectives
• An Analytic Propositional Proof System on Graphs
• Logic programming with multiplicative structures
• Sequent systems on undirected graphs

This page was built for publication: Non decomposable connectives of linear logic

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