Pomset Logic as a Calculus of Directed Cographs

摘要: We give an abstract formulation of proof-structures and nets for pomset logic i.e. linear enriched with a non commutative self-dual connective. A proof-structure is described as directed RB this transformation its inverse preserve correctness. Next we study the impact graph rewriting which axiomatizes inclusion cographs (found D. Bechet Ph. de Groote) on correctness R&B-cographs, show that all rules but one This yields cut-elimination (strongly normalizing confluent) suggests complete sequent calculus Pomset logic. These results also apply to mix rule, since conservati- ve extension it.