Simple Consequence Relations (1991)
| Venue: | Information and Computation |
| Citations: | 91 - 17 self |
BibTeX
@ARTICLE{Avron91simpleconsequence,
author = {Arnon Avron},
title = {Simple Consequence Relations},
journal = {Information and Computation},
year = {1991},
volume = {92},
number = {1},
pages = {105--139}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We provide a general investigation of Logic in which the notion of a simple consequence relation is taken to be fundamental. Our notion is more general than the usual one since we give up monotonicity and use multisets rather than sets. We use our notion for characterizing several known logics (including Linear Logic and non-monotonic logics) and for a general, semantics-independent classification of standard connectives via equations on consequence relations (these include Girard's "multiplicatives" and "additives"). We next investigate the standard methods for uniformly representing consequence relations: Hilbert type, Natural Deduction and Gentzen type. The advantages and disadvantages of using each system and what should be taken as good representations in each case (especially from the implementation point of view) are explained. We end by briefly outlining (with examples) some methods for developing non-uniform, but still efficient, representations of consequence relations.
