The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (i.e. logics containing contradictory but nontrivial theories) having a consistency connective which allows to recover the ex falso quodlibet ...

In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which ...

The rivalry between classical logic and its non-classical contenders occupies the centre stage in contemporary philosophical logic. The central issue is to know how to choose a logical system (or theory thereof) among the ...

We start from the algebraic method of theorem-proving based on the translation of logic formulas into polynomials over finite fields, and adapt the case of first-order formulas by employing certain rings equipped with ...

Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured ...

The Propositional Logic of Proofs (LP) is a modal logic in which the modality □A is revisited as [​[t]​]​A , t being an expression that bears witness to the validity of A . It enjoys arithmetical soundness and ...