Proof nets for unit-free multiplicative-additive linear logic
From MaRDI portal
Publication:5277740
Recommendations
Cited in
(50)- The additive multiboxes
- Softness of MALL proof-structures and a correctness criterion with Mix
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets
- Causality in linear logic. Full completeness and injectivity (unit-free multiplicative-additive fragment)
- Cyclic multiplicative-additive proof nets of linear logic with an application to language parsing
- Event domains, stable functions and proof-nets
- Cyclic multiplicative proof nets of linear logic with an application to language parsing
- scientific article; zbMATH DE number 2185715 (Why is no real title available?)
- Completeness of MLL proof-nets w.r.t. weak distributivity
- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
- Commutative Locative Quantifiers for Multiplicative Linear Logic
- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
- An approach to innocent strategies as graphs
- scientific article; zbMATH DE number 1222110 (Why is no real title available?)
- scientific article; zbMATH DE number 1231532 (Why is no real title available?)
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
- scientific article; zbMATH DE number 1948160 (Why is no real title available?)
- Judgement aggregation in non-classical logics
- Multiplicative-additive proof equivalence is \textsf{logspace}-complete, via binary decision trees
- The consistency and complexity of multiplicative additive system virtual
- No proof nets for MLL with units: proof equivalence in MLL is PSPACE-complete
- Study of behaviours via visitable paths
- scientific article; zbMATH DE number 786496 (Why is no real title available?)
- scientific article; zbMATH DE number 937366 (Why is no real title available?)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- scientific article; zbMATH DE number 7359406 (Why is no real title available?)
- Coherent interaction graphs
- An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
- Proof nets for first-order additive linear logic
- scientific article; zbMATH DE number 7199586 (Why is no real title available?)
- Unification nets: canonical proof net quantifiers
- Logic beyond formulas: a proof system on graphs
- Computer Science Logic
- Correctness of linear logic proof structures is NL-complete
- Proof nets for multiplicative cyclic linear logic and Lambek calculus
- Uniform Circuits, & Boolean Proof Nets
- scientific article; zbMATH DE number 7324256 (Why is no real title available?)
- Representation of partial traces
- A proof of the focusing theorem via MALL proof nets
- The sum-product algorithm for quantitative multiplicative linear logic
- Type isomorphisms for multiplicative-additive linear logic
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
- The exponential logic of sequentialization
- Type isomorphisms for multiplicative-additive linear logic
- The many-worlds calculus
- Linear logic in a refutational setting
- Softness of hypercoherences and MALL full completeness
- The logic of message-passing
- Proof nets sequentialisation in multiplicative linear logic
This page was built for publication: Proof nets for unit-free multiplicative-additive linear logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5277740)
