A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1231525
- scientific article; zbMATH DE number 1114352
- Non-commutative logic. I: The multiplicative fragment
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
- scientific article; zbMATH DE number 2134917
- On noncommutative extensions of linear logic
- Towards a semantics of proofs for non-commutative logic: Multiplicatives and additives
- Geometrical semantics for linear logic (multiplicative fragment)
- Multiplicative linear logics and fibrations
- A correspondence between maximal abelian sub-algebras and linear logic fragments
Cites work
- scientific article; zbMATH DE number 1231525 (Why is no real title available?)
- scientific article; zbMATH DE number 786497 (Why is no real title available?)
- Interpolation in fragments of classical linear logic
- Linear logic
- Phase semantics and sequent calculus for pure noncommutative classical linear propositional logic
- Proof Nets for Lambek Calculus
- Quantales and (noncommutative) linear logic
- The Mathematics of Sentence Structure
- The structure of multiplicatives
Cited in
(7)- Planar and braided proof-nets for multiplicative linear logic with mix
- Sequentialization for n-graphs via sub-n-graphs
- scientific article; zbMATH DE number 1231525 (Why is no real title available?)
- scientific article; zbMATH DE number 2134917 (Why is no real title available?)
- Coherent interaction graphs
- scientific article; zbMATH DE number 7204441 (Why is no real title available?)
- Logic beyond formulas: a proof system on graphs
This page was built for publication: A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398479)