The aim of this article is to discuss pure variable inclusion logics, that is, logical systems where valid entailments require that the propositional variables occurring in the conclusion are included among those appearing in the premises, or vice versa. We study the subsystems of Classical Logic satisfying these requirements and assess the extent to which it is possible to characterise them by means of a single logical matrix. In addition, we semantically describe both of these companions to Classical Logic in (...) terms of appropriate matrix bundles and as semilattice-based logics, showing that the notion of consequence in these logics can be interpreted in terms of truth (or non-falsity) and meaningfulness (or meaninglessness) preservation. Finally, we use Płonka sums of matrices to investigate the pure variable inclusion companions of an arbitrary finitary logic. -/- . (shrink)

We consider the equationally orderable quasivarieties and associate with them deductive systems defined using the order. The method of definition of these deductive systems encompasses the definition of logics preserving degrees of truth we find in the research areas of substructural logics and mathematical fuzzy logic. We prove several general results, for example that the deductive systems so defined are finitary and that the ones associated with equationally orderable varieties are congruential.

Involutive Stone algebras were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued Łukasiewicz–Moisil algebras. In this work we focus on the logic that preserves degrees of truth associated to S-algebras named Six. This follows a very general pattern that can be considered for any class of truth structure endowed with an ordering relation, and which intends to exploit many-valuedness focusing on the notion of inference that results from preserving lower bounds of truth values, and (...) hence not only preserving the value $1$. Among other things, we prove that Six is a many-valued logic that can be determined by a finite number of matrices. Besides, we show that Six is a paraconsistent logic. Moreover, we prove that it is a genuine Logic of Formal Inconsistency with a consistency operator that can be defined in terms of the original set of connectives. Finally, we study the proof theory of Six providing a Gentzen calculus for it, which is sound and complete with respect to the logic. (shrink)

This paper explores a notion of “the strong version” of a sentential logic S, initially defined in terms of the notion of a Leibniz filter, and shown to coincide with the logic determined by the matrices of S whose filter is the least S-filter in the algebra of the matrix. The paper makes a general study of this notion, which appears to unify under an abstract framework the relationships between many pairs of logics in the literature. The paradigmatic examples are (...) the local and the global consequences associated with a normal modal logic, and the logics preserving degrees of truth and preserving truth associated with certain substructural and many-valued logics. For protoalgebraic logics the results in the paper coincide with those obtained by two of the authors in 2001, so the main novelty of the approach is its suitability for all kinds of logics. The paper also studies three kinds of definability of the Leibniz filters, and their consequences for the determination of the strong version. In a second part of the paper several case studies are developed, comprising positive modal logic, Dunn–Belnap’s four-valued logic, the large family of substructural logics, and some relevance logics. (shrink)

We define and study abstract valuation semantics for logics, an algebraically well-behaved version of valuation semantics. Then, in the context of the behavioral approach to the algebraization of logics, we show, by means of meaningful bridge theorems and application examples, that abstract valuations are suited to play a role similar to the one played by logical matrices in the traditional approach to algebraization.

Substructural logics have received a lot of attention in recent years from the communities of both logic and algebra. We discuss the algebraization of substructural logics over the full Lambek calculus and their connections to residuated lattices, and establish a weak form of the deduction theorem that is known as parametrized local deduction theorem. Finally, we study certain interpolation properties and explain how they imply the amalgamation property for certain varieties of residuated lattices.

The paper concerns the algebraic structure of the set of cumulative distribution functions as well as the relationship between the resulting algebra and the infinite-valued Łukasiewicz algebra. The paper also discusses interrelations holding between the logical systems determined by the above algebras.

We investigate certain Brouwer-Zadeh lattices that serve as abstract counterparts of lattices of effects in Hilbert spaces under the spectral ordering. These algebras, called PBZ*-lattices, can also be seen as generalisations of orthomodular lattices and are remarkable for the collapse of three notions of “sharpness” that are distinct in general Brouwer-Zadeh lattices. We investigate the structure theory of PBZ*-lattices and their reducts; in particular, we prove some embedding results for PBZ*-lattices and provide an initial description of the lattice of PBZ*-varieties.

Suszko’s problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski’s structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. (...) In this article we give a more systematic perspective on Suszko’s problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those theorems to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos, and Wansing, for logics with various structural properties. We strengthen these results into exact rank results for nonpermeable logics. We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties. (shrink)

The study of the theory of operators over modal pseudocomplemented De Morgan algebras was begun in papers [20] and [21]. In this paper, we introduce and study the class of modal pseudocomplemented De Morgan algebras enriched by a k-periodic automorphism -algebras). We denote by \ the automorphism where k is a positive integer. For \, the class coincides with the one studied in [20] where the automorphism works as a new unary operator which can be considered as a negation. In (...) the first place, we develop an algebraic study of the class of \-algebras; as consequence, we prove the class \-algebras is a semisimple variety and determine the generating algebras. After doing the algebraic study and using these properties, we built two families of sentential logics that we denote with \ and \ for every k. \ is a 1-assertional logic and \ is the degree-preserving logic both associated with the class of \-algebras. Working over these logics, we prove that \ is paraconsistent with respect to the de Morgan negation \, which is protoalgebraic and finitely equivalential but not algebraizable. In contrast, we prove that \ is algebraizable, sharing the same theorems with \, but not paraconsistent with respect to \. Furthermore, we show that \ and \ are paracomplete logics with respect to \ and \ and paraconsistent logics with respecto to \, for every k. (shrink)

The aim of this article is to explore the class of intermediate logics between the truth-preserving Lukasiewicz logic L and its degree-preserving companion L<⁠. From a syntactical point of view, we introduce some families of inference rules (that generalize the explosion rule) that are admissible in L< and derivable in L and we characterize the corresponding intermediate logics. From a semantical point of view, we first consider the family of logics characterized by matrices defined by lattice filters in ⁠[0,1], but (...) we show there are intermediate logics falling outside this family. Finally, we study the case of finite-valued Lukasiewicz logics where we axiomatize a large family of intermediate logics defined by families of matrices (A,F) such that A is a finite MV-algebra and F is a lattice filter. (shrink)

We define when a ternary term m of an algebraic language \ is called a distributive nearlattice term -term) of a sentential logic \. Distributive nearlattices are ternary algebras generalising Tarski algebras and distributive lattices. We characterise the selfextensional logics with a \-term through the interpretation of the DN-term in the algebras of the algebraic counterpart of the logics. We prove that the canonical class of algebras associated with a selfextensional logic with a \-term is a variety, and we obtain (...) that the logic is in fact fully selfextensional. (shrink)