Editing Noncommutative logic (section)

===Pomset logic===

Pomset logic was proposed by Christian Retoré in a semantic formalism with two dual sequential operators existing together with the usual tensor product and par operators of linear logic, the first logic proposed to have both commutative and noncommutative operators.<ref>{{Cite book| publisher = Springer Berlin Heidelberg| isbn = 978-3-540-62688-6| pages = 300–318|editor1= Philippe de Groote |editor2=[[J. Roger Hindley]] | last = Retoré| first = Christian| title = Typed Lambda Calculi and Applications| volume = 1210| chapter = Pomset logic: A non-commutative extension of classical linear logic| series = Lecture Notes in Computer Science| date = 1997-04-02| doi=10.1007/3-540-62688-3_43|citeseerx=10.1.1.47.2354}}</ref>  A sequent calculus for the logic was given, but it lacked a [[cut-elimination theorem]]; instead the sense of the calculus was established through a denotational semantics.