In the present paper we prove that the poset of all extensions of the logic defined by a class of matrices whose sets of distinguished values are equationally definable by their algebra reducts is the retract, under a Galois connection, of the poset of all subprevarieties of the prevariety generated by the class of the algebra reducts of the matrices involved. We apply this general result to the problem of finding and studying all extensions of the logic of paradox. In (...) order to solve this problem, we first study the structure of prevarieties of Kleene lattices. Then, we show that the poset of extensions of the logic of paradox forms a four-element chain, all the extensions being finitely many-valued and finitely-axiomatizable logics. There are just two proper consistent extensions of the logic of paradox. The first is the classical logic that is relatively axiomatized by the Modus ponens rule for the material implication. The second extension, being intermediate between the logic of paradox and the classical logic, is the one relatively axiomatized by the Ex Contradictione Quodlibet rule. (shrink)

In A. Kumar, & M. Banerjee [(2012). Definable and rough sets in covering-based approximation spaces. In T. Li. (eds.), Rough sets and knowledge technology (pp. 488–495). Springer-Verlag], A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], authors proposed a pair of lower and upper approximation operators based on granules generated by quasiorders. This work is an extension of algebraic results presented therein. A characterisation has been presented for those (...) quasiorder-generated covering-based approximation spaces whose corresponding collections of definable and rough sets form Stone algebras. The notion of rough lattice was proposed in A. Kumar, & M. Banerjee [(2015). Algebras of definable and rough sets in quasi order-based approximation spaces. Fundamenta Informaticae, 141(1), 37–55], A. Kumar [(2020). A Study of Algebras and Logics of Rough Sets Based on Classical and Generalized Approximation Spaces. In Transactions on Rough Sets XXII, LNCS (Vol. 12485, pp. 123–251). Springer]. Some special rough lattices are introduced in this work, viz. rough Stone algebra, ∼1-complemented and ∼2-complemented rough lattices. Representations of these algebras in terms of rough sets are obtained. Moreover, logics for these algebras are shown to be sound and complete with respect to rough set semantics. (shrink)

In this note we shall describe the lattice of the congruences on a balanced Ockham algebra with the pseudocomplementation whose quotient algebras are boolean. This is an extension of the result obtained by Rodrigues and Silva who gave a description of the lattice of congruences on an Ockham algebra whose quotient algebras are boolean.

This article is about Avicenna’s account of syllogisms comprising opposite premises. We examine the applications and the truth conditions of these syllogisms. Finally, we discuss the relation between these syllogisms and the principle of non-contradiction.

In this work, we study the relational representation of the class of Tarski algebras endowed with a subordination, called subordination Tarski algebras. These structures were introduced in a previous paper as a generalisation of subordination Boolean algebras. We define the subordination Tarski spaces as topological spaces with a fixed basis endowed with a closed relation. We prove that there exist categorical dualities between categories whose objects are subordination Tarski algebras and categories whose objects are subordination Tarski spaces. These results extend (...) the known dualities for modal algebras. Finally, we are going to characterise some algebraic conditions written in the quasi-modal language by means of first-order conditions. (shrink)

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

This book presents an English translation of a classic Russian text on duality theory for Heyting algebras. Written by Georgian mathematician Leo Esakia, the text proved popular among Russian-speaking logicians. This translation helps make the ideas accessible to a wider audience and pays tribute to an influential mind in mathematical logic. The book discusses the theory of Heyting algebras and closure algebras, as well as the corresponding intuitionistic and modal logics. The author introduces the key notion of a hybrid that (...) “crossbreeds” topology and order, resulting in the structures now known as Esakia spaces. The main theorems include a duality between the categories of closure algebras and of hybrids, and a duality between the categories of Heyting algebras and of so-called strict hybrids. Esakia’s book was originally published in 1985. It was the first of a planned two-volume monograph on Heyting algebras. But after the collapse of the Soviet Union, the publishing house closed and the project died with it. Fortunately, this important work now lives on in this accessible translation. The Appendix of the book discusses the planned contents of the lost second volume. (shrink)

There is a constructive method to define a structure of simple k-cyclic Post algebra of order p, L p,κ, on a given finite field F, and conversely. There exists an interpretation Ф₁ of the variety V generated by L p,κ into the variety V) generated by F and an interpretation Ф₂ of V) into V such that Ф₂Ф₁ = B for every B ϵ V and Ф₁₂ = R for every R ϵ V). In this paper we show how we (...) can solve an algebraic system of equations over an arbitrary cyclic Post algebra of order p, p prime, using the above interpretation, Gröbner bases and algorithms programmed in Maple. (shrink)

An Ockham lattice is defined to be a distributive lattice with 0 and 1 which is equipped with a dual homomorphic operation. In this paper we prove: (1) The lattice of all equational classes of Ockham lattices is isomorphic to a lattice of easily described first-order theories and is uncountable, (2) every such equational class is generated by its finite members. In the proof of (2) a characterization of orderings of with respect to which the successor function is decreasing is (...) given. (shrink)

In this paper we characterize the MV-algebras containing as subalgebras Post algebras of finitely many orders. For this we study cyclic elements in MV-algebras which are the generators of the fundamental chain of the Post algebras.

We investigate expansions of Heyting algebras in possession of a unary term describing the filters that correspond to congruences. Hasimoto proved that Heyting algebras equipped with finitely many normal operators have such a term, generalising a standard construction on finite-type boolean algebras with operators. We utilise Hasimoto’s technique, extending the existence condition to a larger class of EHAs and some classes of double-Heyting algebras. Such a term allows us to characterise varieties with equationally definable principal congruences using a single equation. (...) Moreover, in the presence of a dual pseudocomplement operation, discriminator varieties are characterised by a pair of equations. We also prove that a variety of dually pseudocomplemented EHAs with a normal filter term is semisimple if and only if it is a discriminator variety. This generalises two known results, one by Kowalski and Kracht for finite-type varieties of BAOs, and the other by the present author for dually pseudocomplemented Heyting algebras without additional operations. (shrink)

We investigate expansions of Heyting algebras in possession of a unary term describing the filters that correspond to congruences. Hasimoto proved that Heyting algebras equipped with finitely many normal operators have such a term, generalising a standard construction on finite-type boolean algebras with operators. We utilise Hasimoto’s technique, extending the existence condition to a larger class of EHAs and some classes of double-Heyting algebras. Such a term allows us to characterise varieties with equationally definable principal congruences using a single equation. (...) Moreover, in the presence of a dual pseudocomplement operation, discriminator varieties are characterised by a pair of equations. We also prove that a variety of dually pseudocomplemented EHAs with a normal filter term is semisimple if and only if it is a discriminator variety. This generalises two known results, one by Kowalski and Kracht for finite-type varieties of BAOs, and the other by the present author for dually pseudocomplemented Heyting algebras without additional operations. (shrink)

The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew . In this paper, it is shown that the equivalent variety semantics of N (namely, the variety of Nelson algebras) and the equivalent variety semantics of NFL ew (namely, a certain variety of FL ew -algebras) are term equivalent. This answers a longstanding question of Nelson [30]. (...) Extensive use is made of the automated theorem-prover Prover9 in order to establish the result. The main result of this paper is exploited in Part II of this series [40] to show that the deductive systems N and NFL ew are definitionally equivalent, and hence that constructive logic with strong negation is a substructural logic over FL ew. (shrink)

The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew. The main result of Part I of this series [41] shows that the equivalent variety semantics of N and the equivalent variety semantics of NFL ew are term equivalent. In this paper, the term equivalence result of Part I [41] is lifted to the setting of deductive (...) systems to establish the definitional equivalence of the logics N and NFL ew. It follows from the definitional equivalence of these systems that constructive logic with strong negation is a substructural logic. (shrink)

This paper investigates the algebraic structure of the Medvedev lattice M. We prove that M is not a Heyting algebra. We point out some relations between M and the Dyment lattice and the Mucnik lattice. Some properties of the degrees of enumerability are considered. We give also a result on embedding countable distributive lattices in the Medvedev lattice.

Let $\mathfrak{M}$ be the Medvedev lattice: this paper investigates some filters and ideals (most of them already introduced by Dyment, [4]) of $\mathfrak{M}$ . If $\mathfrak{G}$ is any of the filters or ideals considered, the questions concerning $\mathfrak{G}$ which we try to answer are: (1) is $\mathfrak{G}$ prime? What is the cardinality of ${\mathfrak{M} \mathord{\left/ {\vphantom {\mathfrak{M} \mathfrak{G}}} \right. \kern-0em} \mathfrak{G}}$ ? Occasionally, we point out some general facts on theT-degrees or the partial degrees, by which these questions can be (...) answered. (shrink)

We compare the degrees of enumerability and the closed Medvedev degrees and find that many situations occur. There are nonzero closed degrees that do not bound nonzero degrees of enumerability, there are nonzero degrees of enumerability that do not bound nonzero closed degrees, and there are degrees that are nontrivially both degrees of enumerability and closed degrees. We also show that the compact degrees of enumerability exactly correspond to the cototal enumeration degrees.

This paper is an historical study of Tarski's methodology of deductive sciences (in which a logic S is identified with an operator Cn S, called the consequence operator, on a given set of expressions), from its appearance in 1930 to the end of the 1970s, focusing on the work done in the field by Roberto Magari, Piero Mangani and by some of their pupils between 1965 and 1974, and comparing it with the results achieved by Tarski and the Polish school (...) (Łoś, Suszko, Słupecki, Pogorzelski, Wójcicki). In the last section of the paper we will then compare these works with some recent developments in algebraic logic: this will lead to a better understanding of the results of the methodology of deductive science, but at the same time will show some intrinsic limits to such an approach to logic. Even if Magari's work on diagonizable algebras and universal algebra and Mangani's axiomatization of MV-algebras and results in model theory are rather famous, the articles on closure operators, published in the 1960s, are almost totally unknown outside Italy (mainly because of a linguistic limitation, the papers we analyse having been written and published in Italian). This paper aims to fill the gap in the literature and to enable the international community to get acquainted with this part of Italian logic. The same applies to some works published in Barcelona (in Catalan) at the end of the 1970s, analysed in the last section. (shrink)

The purpose of this paper is to define and investigate the new class of quasi-Stone algebras . Among other things we characterize the class of simple QSA's and the class of subdirectly irreducible QSA's. It follows from this characterization that the subdirectly irreducible QSA's form an elementary class and that the variety of QSA's is locally finite. Furthermore we prove that the lattice of subvarieties of QSA's is an -chain. MSC: 03G25, 06D16, 06E15.

This paper is a contribution toward developing a theory of expansions of semi-Heyting algebras. It grew out of an attempt to settle a conjecture we had made in 1987. Firstly, we unify and extend strikingly similar results of [ 48 ] and [ 50 ] to the (new) equational class DHMSH of dually hemimorphic semi-Heyting algebras, or to its subvariety BDQDSH of blended dual quasi-De Morgan semi-Heyting algebras, thus settling the conjecture. Secondly, we give a criterion for a unary expansion (...) of semi-Heyting algebras to be a discriminator variety and give an algorithm to produce discriminator varieties. We then apply the criterion to exhibit an increasing sequence of discriminator subvarieties of BDQDSH . We also use it to prove that the variety DQSSH of dually quasi-Stone semi- Heyting algebras is a discriminator variety. Thirdly, we investigate a binary expansion of semi-Heyting algebras, namely the variety DblSH of double semi-Heyting algebras by characterizing its simples, and use the characterization to present an increasing sequence of discriminator subvarieties of DblSH . Finally, we apply these results to give bases for “small” subvarieties of BDQDSH , DQSSH , and DblSH. (shrink)

This paper deals about dualities for bounded prelinear Hilbert algebras. In particular, we give an Esakia-style duality between the algebraic category of bounded prelinear Hilbert algebras and a category of H-spaces whose morphisms are certain continuous p-morphisms.

It is well known that there is a categorical equivalence between lattice-ordered Abelian groups (or l-groups) and conical BCK-algebras (see [COR 80]). The aim of this paper is to study this equivalence from the perspective of logic, in particular, to study the relationship between two deductive systems: conical logic Co and a logic of l-groups, Balo. In [GAL 04] the authors introduce a system Bal which models the logic of balance of opposing forces with a single distinguished truth value, that (...) represents equilibrium. Its equivalent algebraic semantics BAL (via Blok-Pigozzi's construction) is definitionally equivalent to the variety of l-groups. In this paper we define the system Balo which is equivalent to Bal and whose Lindenbaum-Tarski algebra is an l-group. On the other hand, we define the conic logic Co and we prove that it can be naturally merged in the system Balo. Also, we prove that every formula of Balo has a normal form that depends on translations of formulas of Co. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

In this paper we obtain a finite Hilbert-style axiomatization of the implicationless fragment of the intuitionistic propositional calculus. As a consequence we obtain finite axiomatizations of all structural closure operators on the algebra of {–}-formulas containing this fragment.

The aim of this paper is to study the paraconsistent deductive systemP 1 within the context of Algebraic Logic. It is well known due to Lewin, Mikenberg and Schwarse thatP 1 is algebraizable in the sense of Blok and Pigozzi, the quasivariety generated by Sette's three-element algebraS being the unique quasivariety semantics forP 1. In the present paper we prove that the mentioned quasivariety is not a variety by showing that the variety generated byS is not equivalent to any algebraizable (...) deductive system. We also show thatP 1 has no algebraic semantics in the sense of Czelakowski. Among other results, we study the variety generated by the algebraS. This enables us to prove in a purely algebraic way that the only proper non-trivial axiomatic extension ofP 1 is the classical deductive systemPC. Throughout the paper we also study those abstract logics which are in a way similar toP 1, and are called hereabstract Sette logics. We obtain for them results similar to those obtained for distributive abstract logics by Font, Verdú and the author. (shrink)

The aim of this paper is technically to study Belnap's four-valued sentential logic . First, we obtain a Gentzen-style axiomatization of this logic that contains no structural rules while all they are still admissible in the Gentzen system what is proved with using some algebraic tools. Further, the mentioned logic is proved to be the least closure operator on the set of {Λ, V, ⌝}-formulas satisfying Tarski's conditions for classical conjunction and disjunction together with De Morgan's laws for negation. It (...) is also proved that Belnap's logic is the only sentential logic satisfying the above-mentioned conditions together with Anderson-Belnap's Variable-Sharing Property. Finally, we obtain a finite Hilbert-style axiomatization of this logic. As a consequence, we obtain a finite Hilbert-style axiomatization of Priest's logic of paradox. (shrink)