Proof-search in implicative linear logic as a matching problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Proof-search in implicative linear logic as a matching problem

Abstract

We reduce the provability of fragments of multiplicative linear logic to matching problems consisting in finding a one-one-correspondence between two sets of first-order terms together with a unifier that equates the corresponding terms. According to the kind of structure to which these first-order terms belong our matching problem corresponds to provability in the implicative fragment of multiplicative linear logic, in the Lambek calculus, or in the non-associative Lambek calculus.

Domains

Other [cs.OH]
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00099221 , version 1

Cite

Philippe de Groote. Proof-search in implicative linear logic as a matching problem. International Conference on Logic for Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, pp.257-274. ⟨inria-00099221⟩
60 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More