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...
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...
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...
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 ...
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...
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...