Some Issues about Proof Search in Linear Logic - abstract -
Résumé
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.