Monoid based semantics for linear formulas

Journal of Symbolic Logic 66 (4):1597-1619 (2001)
  Copy   BIBTEX

Abstract

Each Girard quantale (i.e., commutative quantale with a selected dualizing element) provides a support for a semantics for linear propositional formulas (but not for linear derivations). Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group (both commutative). In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat way of handling duality

Other Versions

reprint Mitchell, W. P. R.; Simmons, H. (2002) "Monoid based semantics for linear formulas". Journal of Symbolic Logic 67(2):505-527

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,440

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
70 (#297,978)

6 months
25 (#124,828)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

From if to bi.Samson Abramsky & Jouko Väänänen - 2009 - Synthese 167 (2):207 - 230.

Add more citations

References found in this work

Linear Logic.Jean-Yves Girard - 1987 - Theoretical Computer Science 50:1–102.

Add more references