Labelled Structures and Provability in Resource Logics - extended abstract - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Labelled Structures and Provability in Resource Logics - extended abstract

Résumé

We emphasize the interest of labelled structures for analyzing provability in some resource logics. Labels and constraints allow to capture the semantic consequence relation in logics, like BI logic that combines intuitionistic and linear connectives. They provide new methods in proof theory which are based on specific structures, namely dependency graphs or labelled proof nets. Such semantic structures are central for the analysis of provability and the generation of proofs or countermodels. Knowing that BI is conservative w.r.t. Multiplicative Intuitionistic Linear Logic (MILL), we consider MILL from the BI perspective and show how labelled proof structures can provide a new based-on connection characterization of MILL provability. We also provide an algorithm that builds MILL proof nets and its related connection method based on labelled structures and constraints. The generation of proofs and countermodels is analyzed in this context.
Fichier non déposé

Dates et versions

hal-00013785 , version 1 (12-11-2005)

Identifiants

  • HAL Id : hal-00013785 , version 1

Citer

Didier Galmiche, Estelle Dumoulin. Labelled Structures and Provability in Resource Logics - extended abstract. Int. Workshop on Structures and Deduction - the Quest of the Essence of Proofs, SD'05, 2005, Lisbon, Portugal. ⟨hal-00013785⟩
98 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More