HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Refutations as countermodels in intuitionistic linear logic

Dominique Larchey 1
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose to investigate and to reuse the semantics of intuitionistic linear logic (ILL), from an initial analysis of known semantics like phase semantics or Petri net semantics. Thus, we focus on notions like quantale, closure and resource frames, and we define a new semantics of ILL that is called resource semantics. The completeness and finite model property are proved from a based-on proof search method in which countermodels are obtained from refutation trees. Moreover, we define a new preordered monoid semantics from an adequate choice of pretopology. As Petri Nets can be seen as a concrete representation of preordered monoids, such a choice also leads to a new Petri nets semantics for ILL with new results like completeness and finite model property. From these semantical considerations we obtain some results about non-provability in ILL and then we can expect to develop methods for the generation of countermodels.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:47:38 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM


  • HAL Id : inria-00100563, version 1



Dominique Larchey. Refutations as countermodels in intuitionistic linear logic. Semantic Foundations of Proof-search, D. Pym, E. Ritter, T. Streicher, 2001, Schloss Dagsthul/Germany. ⟨inria-00100563⟩



Record views