Pages that link to "Item:Q5277740"
From MaRDI portal
The following pages link to Proof nets for unit-free multiplicative-additive linear logic (Q5277740):
Displaying 31 items.
- An approach to innocent strategies as graphs (Q418201) (← links)
- Correctness of linear logic proof structures is NL-complete (Q534703) (← links)
- Softness of hypercoherences and MALL full completeness (Q705530) (← links)
- The logic of message-passing (Q923880) (← links)
- Proof nets sequentialisation in multiplicative linear logic (Q952490) (← links)
- The additive multiboxes (Q1861326) (← links)
- Softness of MALL proof-structures and a correctness criterion with Mix (Q1882627) (← links)
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets (Q1960420) (← links)
- Cyclic Multiplicative-Additive Proof Nets of Linear Logic with an Application to Language Parsing (Q2835043) (← links)
- Event domains, stable functions and proof-nets (Q2864146) (← links)
- Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing (Q2947459) (← links)
- Completeness of MLL proof-nets w.r.t. weak distributivity (Q3426569) (← links)
- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic (Q3498480) (← links)
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (Q3586061) (← links)
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics (Q4328819) (← links)
- (Q4411821) (← links)
- Judgement aggregation in non-classical logics (Q4586224) (← links)
- (Q4643962) (← links)
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants (Q4917988) (← links)
- (Q4993336) (← links)
- (Q5018489) (← links)
- (Q5089024) (← links)
- (Q5109516) (← links)
- Unification nets (Q5145330) (← links)
- Logic Beyond Formulas (Q5145617) (← links)
- Computer Science Logic (Q5311252) (← links)
- Proof nets for multiplicative cyclic linear logic and Lambek calculus (Q5377696) (← links)
- (Q5854675) (← links)
- Representation of partial traces (Q5971391) (← links)
- A proof of the focusing theorem via MALL proof nets (Q6102990) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)
