A new correctness criterion for MLL proof nets
From MaRDI portal
Recommendations
Cited in
(17)- An algebraic correctness criterion for intuitionistic multiplicative proof-nets
- Non decomposable connectives of linear logic
- A coding theoretic study of MLL proof nets
- On the dependencies of logical rules
- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
- scientific article; zbMATH DE number 1222110 (Why is no real title available?)
- Minimality of the correctness criterion for multiplicative proof nets
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
- An introduction to differential linear logic: proof-nets, models and antiderivatives
- Coherent interaction graphs
- scientific article; zbMATH DE number 7471682 (Why is no real title available?)
- An application of parallel cut elimination in unit-free multiplicative linear logic to the Taylor expansion of proof nets
- scientific article; zbMATH DE number 5033883 (Why is no real title available?)
- Parsing MELL proof nets
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- Exponentials as substitutions and the cost of cut elimination in linear logic
- Exponentially handsome proof nets and their normalization
This page was built for publication: A new correctness criterion for MLL proof nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635623)