Minimality of the correctness criterion for multiplicative proof nets
From MaRDI portal
Publication:4236199
Recommendations
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets
- A new correctness criterion for multiplicative non-commutative proof nets
- scientific article; zbMATH DE number 1114337
- A new correctness criterion for MLL proof nets
- A new correctness criterion for the proof nets of non-commutative multiplicative linear logics
- Proof nets for multiplicative cyclic linear logic and Lambek calculus
- A new correctness criterion for cyclic proof nets
- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
- A formal model for a linear time correctness condition of proof nets of multiplicative linear logic
- A decomposition method for CNF minimality proofs
Cited in
(12)- Rewritings for polarized multiplicative and exponential proof structures
- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete
- Online Enumeration of All Minimal Inductive Validity Cores
- Homology of proof-nets
- Parsing pregroup grammars and Lambek calculus using partial composition
- scientific article; zbMATH DE number 7566060 (Why is no real title available?)
- scientific article; zbMATH DE number 786498 (Why is no real title available?)
- scientific article; zbMATH DE number 786499 (Why is no real title available?)
- A new correctness criterion for MLL proof nets
- An algebraic correctness criterion for intuitionistic multiplicative proof-nets
- A new correctness criterion for multiplicative non-commutative proof nets
- On the dependencies of logical rules
This page was built for publication: Minimality of the correctness criterion for multiplicative proof nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236199)