Proof-search in mixed linear logic - extended abstract. - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Proof-search in mixed linear logic - extended abstract.


In this paper we study proof-search methods in the multiplicative fragment of mixed linear logic that are based on the use of labelled proof nets. We mainly analyze the interaction and relationships in such a logic between the commutative and non-commutative connectives. From previous results on proof search in commutative and non-commutative (or cyclic) linear logic, we propose two different procedures, both based on proof nets search relative to some constraints satisfaction or propagation.
No file

Dates and versions

inria-00099234 , version 1 (26-09-2006)


  • HAL Id : inria-00099234 , version 1


Didier Galmiche, Jean-Marc Notin. Proof-search in mixed linear logic - extended abstract.. CADE-17 Workshop on Proof-theoretic Languages: Proof-search & Semantics, 2000, CMU, Pittsburgh/USA, 14 p. ⟨inria-00099234⟩
118 View
0 Download


Gmail Facebook Twitter LinkedIn More