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.

In conventional generalization of the main results of classical measure theory to Stone algebra valued measures, the values that measures and functions can take are Booleanized, while the classical notion of a σ-field is retained. The main purpose of this paper is to show by abundace of illustrations that if we agree to Booleanize the notion of a σ-field as well, then all the glorious legacy of classical measure theory is preserved completely.

In this paper we shall introduce the variety WQS of weak-quasi-Stone algebras as a generalization of the variety QS of quasi-Stone algebras introduced in [9]. We shall apply the Priestley duality developed in [4] for the variety N of ¬-lattices to give a duality for WQS. We prove that a weak-quasi-Stone algebra is characterized by a property of the set of its regular elements, as well by mean of some principal lattice congruences. We will also determine (...) the simple and subdirectly irreducible algebras. (shrink)

We present two discrete dualities for double Stone algebras. Each of these dualities involves a different class of frames and a different definition of a complex algebra. We discuss relationships between these classes of frames and show that one of them is a weakening of the other. We propose a logic based on double Stone algebras.

In this paper we describe the Priestley space of a quasi-Stone algebra and use it to show that the class of finite quasi-Stone algebras has the amalgamation property. We also describe the Priestley space of the free quasi-Stone algebra over a finite set.

In this note we give equational bases for varieties of quasi-Stone algebras.

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)

In the Laws of Thought, Boole establishes a theory of secondary propositions based upon the notion of time. This temporal interpretation of secondary propositions has historically been met with wide disapproval and is usually dismissed in the modern literature as a philosophical non-starter. What was Boole thinking? This paper attempts to give an answer to this question. Specifically, it provides an account according to which Boole’s temporal interpretation follows from his psychologistic conception of logic, in addition to certain background assumptions (...) regarding the psychological necessity of the concept of time. Once Boole’s psychological premises are laid bare, it becomes clearer how he might have viewed the temporal interpretation to be an essential feature of his theory of secondary propositions. (shrink)

We investigate the class of those algebras in which is a de Morgan algebra, is a quasi-Stone algebra, and the operations \ and \ are linked by the identity x**º = x*º*. We show that such an algebra is subdirectly irreducible if and only if its congruence lattice is either a 2-element chain or a 3-element chain. In particular, there are precisely eight non-isomorphic subdirectly irreducible Stone de Morgan algebras.

We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has αth-jump degree d if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of A with universe ω in (...) which the functions and relations have degree at most c. We show that every degree d ≥ 0 (ω) is the ωth jump degree of a Boolean algebra, but that for $n no Boolean algebra has nth-jump degree $\mathbf{d} > 0^{(n)}$ . The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribed properties. (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)

Let A be an algebra. We say that the functions f 1 , . . . , f m : A n → A are algebraic on A provided there is a finite system of term-equalities $${{\bigwedge t_{k}(\overline{x}, \overline{z}) = s_{k}(\overline{x}, \overline{z})}}$$ satisfying that for each $${{\overline{a} \in A^{n}}}$$, the m -tuple $${{(f_{1}(\overline{a}), \ldots , f_{m}(\overline{a}))}}$$ is the unique solution in A m to the system $${{\bigwedge t_{k}(\overline{a}, \overline{z}) = s_{k}(\overline{a}, \overline{z})}}$$. In this work we present a collection of (...) general tools for the study of algebraic functions, and apply them to obtain characterizations for algebraic functions on distributive lattices, Stone algebras, finite abelian groups and vector spaces, among other well known algebraic structures. (shrink)

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space (...) form a Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

Distributive bounded lattices with a dual homomorphism as unary operation, called Ockham algebras, were firstly studied by Berman (1977). The varieties of Boolean algebras, De Morgan algebras, Kleene algebras and Stone algebras are some of the well known subvarieties of Ockham algebra. In this paper, new results about the congruence lattice of Ockham algebras are given. From these results and Urquhart's representation theorem for Ockham algebras a complete characterization of the subdirectly irreducible Ockham algebras is obtained. These results (...) are particularized for a large number of subvarieties of Ockham algebras. For these subvarieties a full description of their subdirectly irreducible algebras is given as well. (shrink)

In this note we introduce the variety $${{\mathcal C}{\mathcal D}{\mathcal M}_\square}$$ of classical modal De Morgan algebras as a generalization of the variety $${{{\mathcal T}{\mathcal M}{\mathcal A}}}$$ of Tetravalent Modal algebras studied in [ 11 ]. We show that the variety $${{\mathcal V}_0}$$ defined by H. P. Sankappanavar in [ 13 ], and the variety S of Involutive Stone algebras introduced by R. Cignoli and M. S de Gallego in [ 5 ], are examples of classical modal De Morgan (...) algebras. We give a representation theory, and we study the regular filters, i.e., lattice filters closed under an implication operation. Finally we prove that the variety $${{{\mathcal T}{\mathcal M}{\mathcal A}}}$$ has the Amalgamation Property and the Superamalgamation Property. (shrink)

In this article we will focus our attention on the variety of distributive bisemilattices and some linguistic expansions thereof: bounded, De Morgan, and involutive bisemilattices. After extending Balbes’ representation theorem to bounded, De Morgan, and involutive bisemilattices, we make use of Hartonas–Dunn duality and introduce the categories of 2spaces and 2spaces\. The categories of 2spaces and 2spaces\ will play with respect to the categories of distributive bisemilattices and De Morgan bisemilattices, respectively, a role analogous to the category of Stone (...) spaces with respect to the category of Boolean algebras. Actually, the aim of this work is to show that these categories are, in fact, dually equivalent. (shrink)

A systematic approach to the algebraic and Kripke semantics for logics with restricted structural rules, notably for logics on an underlying non-distributive lattice, is developed. We provide a new topological representation theorem for general lattices, using the filter space X. Our representation involves a galois connection on subsets of X, hence a closure operator $\Gamma$, and the image of the representation map is characterized as the collection of $\Gamma$-stable, compact-open subsets of the filter space . The original lattice ${\cal L}$ (...) is thus imbedded in the complete lattice of stable sets. The representation is shown to be functorial and is extended to a Stone-type duality. ;In the presence of additional operators, the extension problem is addressed in terms of what we call adjoint completions of normal operators. An operator f on a lattice L is normal if f: $L\sp{} \times \cdots \times L\sp{} \to L\sp{}$ is a monotone map, where each $L\sp{}$, $i \in n$ + 1, is either L or $L\sp{op}$ and f sends finite joins of $L\sp{}$ to joins in $L\sp{}$. Every familiar operator, such as $\circ$ , + , $\gets, \to, \neg, \square$ O is normal. By a uniform argument we show that normal operators $f\sb{i}$ on L extend to operators $F\sb{i}$ on $\Gamma X$ that distribute over arbitrary joins or meets and that \sb{i\in I})$ is a universal such extension. ;We also raise and resolve the question of representability of operators on stable sets by relations. We give an extensive number of examples of representation of specific operators and provide explicit constructions of canonical Kripke frames, based on our extension arguments, for a number of logical systems, notably for Intuitionistic and Classical Linear Logics, or Non-commutative Linear Logic and of fragments thereof. (shrink)

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)

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work aims to fill this gap by providing a comprehensive logico-algebraic analysis of Lewis's logics. We begin by introducing novel finite axiomatizations for varying strengths of Lewis's logics, distinguishing between global and local consequence relations on Lewisian sphere models. We then demonstrate that the global consequence relation is strongly algebraizable in (...) terms of a specific class of Boolean algebras with a binary operator representing the counterfactual implication; in contrast, we show that the local consequence relation is generally not algebraizable, although it can be characterized as the degree-preserving logic over the same algebraic models. Further, we delve into the algebraic semantics of Lewis's logics, developing two dual equivalences with respect to particular topological spaces. In more details, we show a duality with respect to the topological version of Lewis's sphere models, and also with respect to Stone spaces with a selection function; using the latter, we demonstrate the strong completeness of Lewis's logics with respect to sphere models. Finally, we draw some considerations concerning the limit assumption over sphere models. (shrink)

In this paper we show that the prime ideal space of an MV-algebra is the disjoint union of prime ideal spaces of suitable local MV-algebras. Some special classes of algebras are defined and their spaces are investigated. The space of minimal prime ideals is studied as well.

Some aspects of the theory of Boolean algebras and distributive lattices–in particular, the Stone Representation Theorems and the properties of filters and ideals–are analyzed in a constructive setting.

In this paper we pursue the study of the variety of m -generalized Łukasiewicz algebras of order n which was initiated in [1]. This variety contains the variety of Łukasiewicz algebras of order n . Given , we establish an isomorphism from its congruence lattice to the lattice of Stone filters of a certain Łukasiewicz algebra of order n and for each congruence on A we find a description via the corresponding Stone filter. We characterize the principal (...) congruences on A via Stone filters. In doing so, we obtain a polynomial equation which defines the principal congruences on the algebras of . After showing that for m > 1 and n > 2, the variety of Łukasiewicz algebras of order n is a proper subvariety of , we prove that is a finitely generated discriminator variety and point out some consequences of this strong property, one of which is congruence permutability. (shrink)

The variety $\mathbb{DHMSH}$ of dually hemimorphic semi-Heyting algebras was introduced in 2011 by the second author as an expansion of semi-Heyting algebras by a dual hemimorphism. In this paper, we focus on the variety $\mathbb{DHMSH}$ from a logical point of view. The paper presents an extensive investigation of the logic corresponding to the variety of dually hemimorphic semi-Heyting algebras and of its axiomatic extensions, along with an equally extensive universal algebraic study of their corresponding algebraic semantics. Firstly, we present a (...) Hilbert-style axiomatization of a new logic called "Dually hemimorphic semi-Heyting logic" ($\mathcal{DHMSH}$, for short), as an expansion of semi-intuitionistic logic $\mathcal{SI}$ (also called $\mathcal{SH}$) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety $\mathbb{DHMSH}$. It is deduced that the logic $\mathcal{DHMSH}$ is algebraizable in the sense of Blok and Pigozzi, with the variety $\mathbb{DHMSH}$ as its equivalent algebraic semantics and that the lattice of axiomatic extensions of $\mathcal{DHMSH}$ is dually isomorphic to the lattice of subvarieties of $\mathbb{DHMSH}$. A new axiomatization for Moisil's logic is also obtained. Secondly, we characterize the axiomatic extensions of $\mathcal{DHMSH}$ in which the "Deduction Theorem" holds. Thirdly, we present several new logics, extending the logic $\mathcal{DHMSH}$, corresponding to several important subvarieties of the variety $\mathbb{DHMSH}$. These include logics corresponding to the varieties generated by two-element, three-element and some four-element dually quasi-De Morgan semi-Heyting algebras, as well as a new axiomatization for the 3-valued Łukasiewicz logic. Surprisingly, many of these logics turn out to be connexive logics, only a few of which are presented in this paper. Fourthly, we present axiomatizations for two infinite sequences of logics namely, De Morgan Gödel logics and dually pseudocomplemented Gödel logics. Fifthly, axiomatizations are also provided for logics corresponding to many subvarieties of regular dually quasi-De Morgan Stone semi-Heyting algebras, of regular De Morgan semi-Heyting algebras of level 1, and of JI-distributive semi-Heyting algebras of level 1. We conclude the paper with some open problems. Most of the logics considered in this paper are discriminator logics in the sense that they correspond to discriminator varieties. Some of them, just like the classical logic, are even primal in the sense that their corresponding varieties are generated by primal algebras. (shrink)

For the modal logic $\textsf {S4}^{C}_{I}$, we identify the class of completable $\textsf {S4}^{C}_{I}$-algebras and prove for them a Stone-type representation theorem. As a consequence, we obtain strong algebraic and topological completeness of the logic $\textsf {S4}^{C}_{I}$ in the case of local semantic consequence relations. In addition, we consider an extension of the logic $\textsf {S4}^{C}_{I}$ with certain infinitary derivations and establish the corresponding strong completeness results for the enriched system in the case of global semantic consequence relations.

In this paper, inspired by methods of Bigard, Keimel, and Wolfenstein , we develop an approach to sheaf representations of MV-algebras which combines two techniques for the representation of MV-algebras devised by Filipoiu and Georgescu and by Dubuc and Poveda . Following Davey approach , we use a subdirect representation of MV-algebras that is based on local MV-algebras. This allowed us to obtain: a representation of any MV-algebras as MV-algebra of all global sections of a sheaf of local MV-algebras (...) on the spectruum of its prime ideals; a representation of MV-algebras, having the space of minimal prime ideals compact, as MV-algebra of all global sections of a Hausdorff sheaf of MV-chains on the space of minimal prime ideals, which is a Stone space; an adjunction between the category of all MV-algebras and the category of MV-algebraic spaces, where an MV-algebraic space is a pair , where X is a compact topological space and F is a sheaf of MV-algebras with stalks that are local. (shrink)

Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the Jónsson (...) and Tarski representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality. (shrink)

If there is a ‘platonic world’ \ of mathematical facts, what does \ contain precisely? I observe that if \ is too large, it is uninteresting, because the value is in the selection, not in the totality; if it is smaller and interesting, it is not independent of us. Both alternatives challenge mathematical platonism. I suggest that the universality of our mathematics may be a prejudice and illustrate contingent aspects of classical geometry, arithmetic and linear algebra, making the case (...) that what we call “mathematics” is always contingent. (shrink)

In the present paper, we study the correspondence and canonicity theory of modal subordination algebras and their dual Stone space with two relations, generalizing correspondence results for subordination algebras in [13–15, 25]. Due to the fact that the language of modal subordination algebras involves a binary subordination relation, we will find it convenient to use the so-called quasi-inequalities and $\varPi _{2}$-statements. We use an algorithm to transform (restricted) inductive quasi-inequalities and (restricted) inductive $\varPi _{2}$-statements to equivalent first-order correspondents on (...) the dual Stone spaces with two relations with respect to arbitrary (resp. admissible) valuations. (shrink)

In this paper, we discuss some questions about compactness in MV-topological spaces. More precisely, we first present a Tychonoff theorem for such a class of fuzzy topological spaces and some consequence of this result, among which, for example, the existence of products in the category of Stone MV-spaces and, consequently, of coproducts in the one of limit cut complete MV-algebras. Then we show that our Tychonoff theorem is equivalent, in ZF, to the Axiom of Choice, classical Tychonoff theorem, and (...) Lowen’s analogous result for lattice-valued fuzzy topology. Last, we show an extension of the Stone–Čech compactification functor to the category of MV-topological spaces, and we discuss its relationship with previous works on compactification for fuzzy topological spaces. (shrink)

We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on proof terms and equality predicate on terms. Moreover, the completeness theorem and certain generalizations of Stone’s representation theorem are obtained for all proposed algebras.

In this paper, we develop a duality for the varieties of a Łukasiewicz n + 1-valued modal System. This duality is an extension of Stone duality for modal algebras. Some logical consequences (such as completeness results, correspondence theory...) are then derived and we propose some ideas for future research.

Let B be a superatomic Boolean algebra (BA). The rank of B (rk(B)), is defined to be the Cantor Bendixon rank of the Stone space of B. If a ∈ B - {0}, then the rank of a in B (rk(a)), is defined to be the rank of the Boolean algebra $B b \upharpoonright a \overset{\mathrm{def}}{=} \{b \in B: b \leq a\}$ . The rank of 0 B is defined to be -1. An element a ∈ B (...) - {0} is a generalized atom $(a \in \widehat{At}(B))$ , if the last nonzero cardinal in the cardinal sequence of B $\upharpoonright$ a is 1. Let a,b $\in\widehat{At}$ (B). We denote a ∼ b, if rk(a) = rk(b) = rk(a · b). A subset H $\subseteq \widehat{At}$ (B) is a complete set of representatives (CSR) for B, if for every a $\in \widehat{At}$ (B) there is a unique h ∈ H such that h ∼ a. Any CSR for B generates B. We say that B is canonically well-generated (CWG), if it has a CSR H such that the sublattice of B generated by H is well-founded. We say that B is well-generated, if it has a well-founded sublattice L such that L generates B. THEOREM 1. Let B be a Boolean algebra with cardinal sequence $\langle\aleph_0: i . If B is CWG, then every subalgebra of B is CWG. A superatomic Boolean algebra B is essentially low (ESL), if it has a countable ideal I such that rk(B/I) ≤ 1. Theorem 1 follows from Theorem 2.9, which is the main result of this work. For an ESL BA B we define a set F B of partial functions from a certain countably infinite set to ω (Definition 2.8). Theorem 2.9 says that if B is an ESL Boolean algebra, then the following are equivalent. (1) Every subalgebra of B is CWG; and (2) F B is bounded. THEOREM 2. If an ESL Boolean algebra is not CWG, then it has a subalgebra which is not well-generated. (shrink)

We study a generalization of the standard syntax and game-theoretic semantics of logic, which is based on a duality between two players, to a multiplayer setting. We define propositional and modal languages of multiplayer formulas, and provide them with a semantics involving a multiplayer game. Our focus is on the notion of equivalence between two formulas, which is defined by saying that two formulas are equivalent if under each valuation, the set of players with a winning strategy is the same (...) in the two respective associated games. We provide a derivation system which enumerates the pairs of equivalent formulas, both in the propositional case and in the modal case. Our approach is algebraic: We introduce multiplayer algebras as the analogue of Boolean algebras, and show, as the corresponding analog to Stone’s theorem, that these abstract multiplayer algebras can be represented as concrete ones which capture the game-theoretic semantics. For the modal case we prove a similar result. We also address the computational complexity of the problem whether two given multiplayer formulas are equivalent. In the propositional case, we show that this problem is co-NP-complete, whereas in the modal case, it is PSPACE-hard. (shrink)