## Keywords (1)

Publications
Simple Consequence Relations

# Simple Consequence Relations,10.1016/0890-5401(91)90023-U,Information and Computation/information and Control,Arnon Avron

Simple Consequence Relations
We provide a general investigation of Logic in which the notion ofa simple consequence relation is taken to be fundamental. Our notionis more general than the usual one since we give up monotonicityand use multisets rather than sets. We use our notion for characterizingseveral known logics (including Linear Logic and non-monotoniclogics) and for a general, semantics-independent classification of standardconnectives via equations on consequence relations (these includeGirard's...
Journal: Information and Computation/information and Control - IANDC , vol. 92, no. 1, pp. 105-140, 1991

## Citation Context (44)

• ...The rule should also be pure in the sense of [1] (i.e...

### Arnon Avron, et al. Strict Canonical Constructive Systems

• ...notion of (abstract) consequence relation has been formalised by Gentzen, Tarski and Scott [2,22,45]...
• ...A generalisation by Avron [2] also allows for inclusion of substructural (e.g., non-monotonic) logics...
• ...1 More general notions work with multisets instead of sets of premises [2]...
• ...Note that our definition of negation also covers intuitionistic negation (unlike the treatment in [2], which assumes ¬¬-elimination)...
• ...A theory Γ ⊆ S is satisfiable ,i f it has am odelM (i.e., a model M ∈M such that M |= ϕ for ϕ ∈ Γ). Semantic entailment in a room is defined as usual: for Γ ⊆ S and ϕ ∈ S, we write Γ |= ϕ, if all models satisfying all sentences in Γ also satisfy ϕ. The following result is folklore [2]:...
• ...What happens then when we change the set of propositional symbols? For example [2,3] mention the property of an entailment relation to be stable under mappings of the propositional variables...

### Till Mossakowski, et al. What is a Logic Translation?

• ...The rule should also be pure in the sense of [1] (i.e., there should be no side conditions limiting its application), and its active formulas should be immediate subformulas of its principal formula...

### Arnon Avron, et al. Canonical Constructive Systems

• ...However, it rules out from the class of “logics in L” just two trivial logics (see [7]), and it is technically convenient to include it. 5 See [1] for the differences between the “truth” and “validity” consequence relations of...

### Arnon Avron. Multi-valued Semantics: Why and How

• ...All rule systems representable in LF satisfy the structural properties of a hypothetical judgement (weakening, exchange, contraction, and substitution) because all LF rules are pure [4]—they place no constraints on the context in which they can be applied...

## References (24)

### How a computer should think(Citations: 147)

Published in 1977.

### A Short Introduction to Modal Logic(Citations: 21)

Published in 1992.

### Introduction to mathematical logic(Citations: 719)

Published in 1964.

### A Framework for Defining Logics(Citations: 727)

Conference: Logic in Computer Science - LICS , pp. 194-204, 1987

### What Is an Inference Rule?(Citations: 20)

Journal: Journal of Symbolic Logic - JSYML , vol. 57, no. 3, pp. 1018-1045, 1992
Sort by: