DMCA
Deciding Provability of Linear Logic Formulas (1994)
| Venue: | Advances in Linear Logic |
| Citations: | 29 - 0 self |
BibTeX
@INPROCEEDINGS{Lincoln94decidingprovability,
author = {Patrick Lincoln},
title = {Deciding Provability of Linear Logic Formulas},
booktitle = {Advances in Linear Logic},
year = {1994},
pages = {109--122},
publisher = {Cambridge University Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Introduction There are many interesting fragments of linear logic worthy of study in their own right, most described by the connectives which they employ. Full linear logic includes all the logical connectives, which come in three dual pairs: the exponentials ! and ?, the additives & and \Phi, and the multiplicatives\Omega and . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ........ . SRI International Computer Science Laboratory, Menlo Park CA 94025 USA. Work supported under NSF Grant CCR-9224858. lincoln@csl.sri.com http://www.csl.sri.com/lincoln/lincoln.html Patrick Lincoln For the most part we will consider fragments of linear logic built up using these connectives in any combination. For example, full linear logic formulas may employ any connective, while multiplic
