We will present a three-valued consequence relation for metainferences, called CM, defined through ST and TS, two well known substructural consequence relations for inferences. While ST recovers every classically valid ...

When discussing Logical Pluralism several critics argue that such an open-minded position is untenable. The key to this conclusion is that, given a number of widely accepted assumptions, the pluralist view collapses into ...

We will present all the mixed and impure disjoint three-valued logics based on the Strong Kleene schema. Some, but not all of them, are (inferentially) empty logics, while one of them is trivial. We will compare them ...

Spinks and Veroff have shown that constructive logic with strong negation (CLSN for short), can be considered as a substructural logic. We use algebraic tools developed to study substructural logics to investigate some ...

We will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: K3, LP, ST or TS+. We will show that ...

It is well known that context dependent logical rules can be problematic both to implement and reason about. This is one of the factors driving the quest for better behaved, i.e., local, logical systems. In this work we ...

The aim of this thesis is to study a family of logics, comprised of Nelson’s logic S, constructive logic with strong negation N 3, quasi-Nelson logic QN and quasi-Nelson implicative logic QN I. This is done in two ways. ...

Recently, several authors have pointed out that substructural logics are adequate for developing naive theories that represent semantic concepts such as truth. Among them, three proposals have been explored: dropping cut, ...

In the paper Busaniche and Cignoli (2009) we presented a quasivariety of commutative residuated lattices, called NPc-lattices, that serves as an algebraic semantics for paraconsistent Nelson's logic. In the present paper ...

In the literature on self-referential paradoxes one of the hardest and most challenging problems is that of revenge. This problem can take many shapes, but, typically, it besets non-classical accounts of some semantic ...