DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016 · 11 citations · 0 references
ComputingComputer ScienceMathematicsFormal MethodsLogicTheory Of ComputationMathematical LogicModel TheoryProof ComplexityProof TheoryRelational Data ModelTheorem ProvingCompletenessComputational LogicFormal Proof SystemsProof NetsProof Systems
We prove a completeness result for Multiplicative Exponential Linear Logic (MELL): we show that the relational model is injective for MELL proof-nets, i.e. the equality between MELL proof-nets in the relational model is exactly axiomatized by cut-elimination.