This paper offers a logico-algebraic investigation of AGM belief revision based on the logic of paradox ( \(\mathrm {LP}\) ). First, we define a concrete belief revision operator for \(\mathrm {LP}\), proving that it satisfies a generalised version of the traditional AGM postulates. Moreover, we investigate to what extent the Levi and Harper identities, in their classical formulation, can be applied to a paraconsistent account of revision. We show that a generalised Levi-type identity still yields paraconsistent-based revisions that are fully (...) compatible with the AGM postulates. The main outcome is that, once the classical AGM framework is lifted up to an appropriate level of generality, it still appears as a regulative ideal for treating of paraconsistent-based epistemic operators. (shrink)

Two classes of π are studied whose properties are similar to those of the protoalgebraic deductive systems of Blok and Pigozzi. The first is the class of N-protoalgebraic π-institutions and the second is the wider class of N-prealgebraic π-institutions. Several characterizations are provided. For instance, N-prealgebraic π-institutions are exactly those π-institutions that satisfy monotonicity of the N-Leibniz operator on theory systems and N-protoalgebraic π-institutions those that satisfy monotonicity of the N-Leibniz operator on theory families. Analogs of the correspondence property of (...) Blok and Pigozzi for π-institutions are also introduced and their connections with preand protoalgebraicity are explored. Finally, relations of these two classes with the (, N)-algebraic systems, introduced previously by the author as an analog of the -algebras of Font and Jansana, and with an analog of the Suszko operator of Czelakowski for π-institutions are also investigated. (shrink)

We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.

We provide a new proof of the following Pałasińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal ${\mathcal{Q}}$ Q -subrelations. This (...) is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties. (shrink)

Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic π-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from the sentential framework to the π-institution (...) framework. Many properties of protoalgebraic logics, studied in the sentential logic framework by Blok and Pigozzi, Czelakowski, and Font and Jansana, among others, have already been adapted in previous work by the author to the categorical level. This work aims at further advancing that study by exploring in this new level some more properties of protoalgebraic sentential logics. (shrink)

Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary protoalgebraic deductive systems. As an application, we obtain a Sahlqvist theorem for the fragments of the intuitionistic propositional calculus that include the implication connective and for the extensions of the intuitionistic linear logic.

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACSs A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures (...) with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACSs A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. (shrink)

In this paper we investigate AGM belief contraction operators by using the tools of algebraic logic. We generalize the notion of contraction to arbitrary finitary propositional logics, and we show how to switch from a syntactic-based approach to a semantic one. This allows to build a solid bridge between the validity of AGM postulates in a propositional logic and specific algebraic properties of its intended algebraic counterpart. Such a connection deserves particular attention when we deal with maxichoice contractions, as studied (...) in the final part of the paper. (shrink)

This paper is a continuation of [27], where we provide the background and the basic tools for studying the structural properties of classes of models over languages without equality. In the context of such languages, it is natural to make distinction between two kinds of classes, the so-called abstract classes, which correspond to those closed under isomorphic copies in the presence of equality, and the reduced classes, i.e., those obtained by factoring structures by their largest congruences. The generic problem described (...) in [27] is to investigate under what conditions this reduction process does not alter the metatheory of a class. Here we focus our attention on a concrete aspect of this generic problem that we import from universal algebra, namely the existence and description of free models. As in [27], we can find here again the basic notion of protoalgebraicity, which was originally introduced in [7] as the weakest condition to guarantee that the reduction process behaves reasonably well from an algebraic point of view. Our concern, however, takes us to handle a further notion, that of semialgebraicity, which corresponds to the notion of equivalential logic of [18]; semialgebraicity turns out to be the property which ensures that freeness is fully preserved by the reduction process. (shrink)

This paper is a continuation of [27], where we provide the background and the basic tools for studying the structural properties of classes of models over languages without equality. In the context of such languages, it is natural to make distinction between two kinds of classes, the so-calledabstruct classes, which correspond to those closed under isomorphic copies in the presence of equality, and thereduced classes, i.e., those obtained by factoring structures by their largest congruences. The generic problem described in [27] (...) is to investigate under what conditions thisreduction processdoes not alter the metatheory of a class.Here we focus our attention on a concrete aspect of this generic problem that we import from universal algebra, namely the existence and description of free models. As in [27], we can find here again the basic notion ofprotoalgebraicity, which was originally introduced in [7] as the weakest condition to guarantee that the reduction process behaves reasonably well from an algebraic point of view. Our concern, however, takes us to handle a further notion, that ofsemialgebraicity, which corresponds to the notion ofequivalential logicof [18]; semialgebraicity turns out to be the property which ensures that freeness is fully preserved by the reduction process. (shrink)