Some Issues about Proof Search in Linear Logic - abstract - - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Some Issues about Proof Search in Linear Logic - abstract -

Didier Galmiche

Abstract

The analysis and the automated construction of new semantic structures such as proof nets can be seen as an issue for proof-search, with some relationships with more classical and efficient search methods. The interest of such structures will be emphasized in different ways: their relationships with based-on connections provability characterizations, their use to analyse non-provability in commutative and non-commutative logics, the use of labelled proof nets to consider the linear intuitionistic provability from linear classical search. The study of completeness results is also essential to propose semantics that could have strong impact on proof-search. It will be illustrated by a revised semantics of intuitionistic linear logic, that allows to naturally establish the non-provability of some formulae.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00098991 , version 1

Cite

Didier Galmiche. Some Issues about Proof Search in Linear Logic - abstract -. Logic & Computation - LC'99, Workshop on Proofs, 1999, Edinburgh, Scotland, 36 p. ⟨inria-00098991⟩
44 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More