Sciweavers

IGPL
1998
65views more  IGPL 1998»
13 years 11 months ago
The Linear Logic of Multisets
Athanassios Tzouvaras
IGPL
1998
115views more  IGPL 1998»
13 years 11 months ago
Bridging de Bruijn Indices and Variable Names in Explicit Substitutions Calculi
Calculi of explicit substitutions have almost always been presented using de Bruijn indices with the aim of avoiding -conversion and being as close to machines as possible. De Bru...
Fairouz Kamareddine, Alejandro Ríos
IGPL
1998
127views more  IGPL 1998»
13 years 11 months ago
An Analysis of (Linear) Exponentials Based on Extended Sequents
We apply the 2-sequents approach to the analysis of several calculi derived from linear logic. We present a uniform formal system for Linear Logic, Elementary Linear Logic and Lig...
Stefano Guerrini, Simone Martini, Andrea Masini
IGPL
1998
97views more  IGPL 1998»
13 years 11 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
IGPL
1998
86views more  IGPL 1998»
13 years 11 months ago
A Brief Note About Rott Contraction
One of the ways to model contraction functions for belief sets is epistemic entrenchment. The first step was provided by G¨ardenfors in [5], who defined epistemic entrenchment ...
Eduardo L. Fermé, Ricardo Oscar Rodrí...
IGPL
1998
58views more  IGPL 1998»
13 years 11 months ago
Two Types of Multiple-Conclusion Systems
Hypersequents are nite sets of ordinary sequents. We show that multiple-conclusion sequents and single-conclusion hypersequents represent two di erent natural methods of switching...
Arnon Avron
IGPL
1998
64views more  IGPL 1998»
13 years 11 months ago
Formulas for which Contraction is Admissible
A formula A is said to have the contractionproperty in a logic L i whenever A;A;? `L B (when ? is a multiset) also A;? `L B. In MLL and in MALL without the additive constants a fo...
Arnon Avron