On noncommutative extensions of linear logic

@article{Slavnov2017OnNE,
  title={On noncommutative extensions of linear logic},
  author={Sergey Slavnov},
  journal={Logical Methods in Computer Science},
  year={2017},
  volume={15}
}
  • Sergey Slavnov
  • Published 2017
  • Computer Science, Mathematics
  • Logical Methods in Computer Science
  • Pomset logic introduced by Retore is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus. Later a deep inference system BV was developed with an eye to capturing Pomset logic, but equivalence of system has not been proven up to now. As for a sequent calculus formulation, it has not been known for either of these logics, and there are convincing arguments that such a sequent calculus in the usual… CONTINUE READING
    4
    Twitter Mentions

    Topics from this paper.

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES

    Pomset Logic: A Non-commutative Extension of Classical Linear Logic

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Non-Commutative Logic I: The Multiplicative Fragment

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Phase Semantics and Sequent Calculus for Pure Noncommutative Classical Linear Propositional Logic

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Pomset logic: A noncommutative extension of classical linear logic Typed Lambda Calculi and Applications. TLCA 1997

    • C Retoré
    • Lecture Notes in Computer Science
    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    The Consistency and Complexity of Multiplicative Additive System Virtual

    • Ross Horne
    • Mathematics, Computer Science
    • Sci. Ann. Comp. Sci.
    • 2015
    VIEW 1 EXCERPT

    Typed Lambda Calculi and Applications

    Deep Inference and Probabilistic Coherence Spaces

    VIEW 2 EXCERPTS