Subvarieties of the class of MS-algebras

1983 ◽  
Vol 95 (1-2) ◽  
pp. 157-169 ◽  
Author(s):  
T. S. Blyth ◽  
J. C. Varlet
Keyword(s):  
Distributive Lattice ◽  
Homomorphic Image ◽  
Lattice Of Subvarieties ◽  
De Morgan Algebras

SynopsisIn a previous publication (1983), we defined a class of algebras, denoted by MS, which generalises both de Morgan algebras and Stone algebras. Here we describe the lattice of subvarieties of MS. This is a 20-element distributive lattice. We then characterise all the subvarieties of MS by means of identities. We also show that some of these subvarieties can be described in terms of three important subsets of the algebra. Finally, we determine the greatest homomorphic image of an MS-algebra that belongs to a given subvariety.

scholarly journals On some varieties of ai-semirings satisfying xp+1 ≈ x

2018 ◽  
Vol 16 (1) ◽  
pp. 913-923
Author(s):  
Aifa Wang ◽  
Yong Shao
Keyword(s):  
Distributive Lattice ◽  
Finitely Based ◽  
Finitely Generated ◽  
Lattice Of Subvarieties

AbstractThe aim of this paper is to study the lattice of subvarieties of the ai-semiring variety defined by the additional identities$$\begin{array}{} \displaystyle x^{p+1}\approx x\,\,\mbox{and}\,\,zxyz\approx(zxzyz)^{p}zyxz(zxzyz)^{p}, \end{array} $$wherepis a prime. It is shown that this lattice is a distributive lattice of order 179. Also, each member of this lattice is finitely based and finitely generated.

scholarly journals The ideal lattice of an MS-algebra

1988 ◽  
Vol 30 (2) ◽  
pp. 137-143 ◽  
Author(s):  
T. S. Blyth ◽  
J. C. Varlet
Keyword(s):  
Prime Ideal ◽  
Distributive Lattice ◽  
Unary Operation ◽  
Stone Algebra ◽  
Ideal Lattice ◽  
Prime Filter ◽  
De Morgan Algebra ◽  
De Morgan Algebras ◽  
The Ideal

Recently we introduced the notion of an MS-algebra as a common abstraction of a de Morgan algebra and a Stone algebra [2]. Precisely, an MS-algebra is an algebra 〈L; ∧, ∨ ∘, 0, 1〉 of type 〈2, 2, 1, 0, 0〉 such that 〈L; ∧, ∨, 0, 1〉 is a distributive lattice with least element 0 and greatest element 1, and x → x∘ is a unary operation such that x ≤ x∘∘, (x ∧ y)∘ = x∘ ∨ y∘ and 1∘ = 0. It follows that ∘ is a dual endomorphism of L and that L∘∘ = {x∘∘ x ∊ L} is a subalgebra of L that is called the skeleton of L and that belongs to M, the class of de Morgan algebras. Clearly, theclass MS of MS-algebras is equational. All the subvarieties of MS were described in [3]. The lattice Λ (MS) of subvarieties of MS has 20 elements (see Fig. 1) and its non-trivial part (we exclude T, the class of one-element algebras) splits into the prime filter generated by M, that is [M, M1], the prime ideal generated by S, that is [B, S], and the interval [K, K2 ∨ K3].

On a common abstraction of de Morgan algebras and Stone algebras

1983 ◽  
Vol 94 (3-4) ◽  
pp. 301-308 ◽  
Author(s):  
T. S. Blyth ◽  
J. C. Varlet
Keyword(s):  
Distributive Lattice ◽  
Subdirectly Irreducible ◽  
Bounded Distributive Lattice ◽  
Subdirect Irreducibility ◽  
De Morgan Algebras ◽  
Simple Equations ◽  
Lattice Of Congruences

SynopsisWe consider a common abstraction of de Morgan algebras and Stone algebras which we call an MS-algebra. The variety of MS-algebras is easily described by adjoining only three simple equations to the axioms for a bounded distributive lattice. We first investigate the elementary properties of these algebras, then we characterise the least congruence which collapses all the elements of an ideal, and those ideals which are congruence kernels. We introduce a congruence which is similar to the Glivenko congruence in a p-algebra and show that the location of this congruence in the lattice of congruences is closely related to the subdirect irreducibility of the algebra. Finally, we give a complete description of the subdirectly irreducible MS-algebras.

scholarly journals Logics of Involutive Stone Algebras

2021 ◽  
Author(s):  
Sérgio Marcelino ◽  
Umberto Rivieccio
Keyword(s):  
Distributive Lattice ◽  
Independent Interest ◽  
Stone Algebra ◽  
De Morgan Algebra ◽  
De Morgan Algebras ◽  
Finite Set ◽  
Wide Family ◽  
Base Logic

Abstract An involutive Stone algebra (IS-algebra) is a structure that is simultaneously a De Morgan algebra and a Stone algebra (i.e. a pseudo-complemented distributive lattice satisfying the well-known Stone identity, ∼ x ∨ ∼ ∼ x ≈ 1). IS-algebras have been studied algebraically and topologically since the 1980’s, but a corresponding logic (here denoted IS ≤ ) has been introduced only very recently. The logic IS ≤ is the departing point for the present study, which we then extend to a wide family of previously unknown logics defined from IS-algebras. We show that IS ≤ is a conservative expansion of the Belnap-Dunn four-valued logic (i.e. the order-preserving logic of the variety of De Morgan algebras), and we give a finite Hilbert-style axiomatization for it. More generally, we introduce a method for expanding conservatively every super-Belnap logic so as to obtain an extension of IS ≤ . We show that every logic thus defined can be axiomatized by adding a fixed finite set of rule schemata to the corresponding super-Belnap base logic. We also consider a few sample extensions of IS ≤ that cannot be obtained in the above- described way, but can nevertheless be axiomatized finitely by other methods. Most of our axiomatization results are obtained in two steps: through a multiple-conclusion calculus first, which we then reduce to a traditional one. The multiple-conclusion axiomatizations introduced in this process, being analytic, are of independent interest from a proof-theoretic standpoint. Our results entail that the lattice of super-Belnap logics (which is known to be uncountable) embeds into the lattice of extensions of IS ≤ . Indeed, as in the super-Belnap case, we establish that the finitary extensions of IS ≤ are already uncountably many.

scholarly journals De Morgan Functions and Free De Morgan Algebras

2014 ◽  
Vol 47 (2) ◽  
Author(s):  
Yu. M. Movsisyan ◽  
V. A. Aslanyan ◽  
Alex Manoogian
Keyword(s):  
Boolean Algebra ◽  
Distributive Lattice ◽  
Boolean Functions ◽  
Bounded Lattice ◽  
De Morgan Algebra ◽  
Bounded Distributive Lattice ◽  
Monotone Boolean Functions ◽  
Free Generators ◽  
De Morgan Algebras

AbstractIt is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone Boolean functions of n variables. In this paper, we introduce the concept of De Morgan function and prove that the free De Morgan algebra on n free generators is isomorphic to the De Morgan algebra of De Morgan functions of n variables. This is a solution of the problem suggested by B. I. Plotkin.

The Boolean Algebra of Regular Open Sets

1953 ◽  
Vol 5 ◽  
pp. 95-100 ◽  
Author(s):  
R. S. Pierce
Keyword(s):  
Boolean Algebra ◽  
Topological Space ◽  
Distributive Lattice ◽  
Homomorphic Image ◽  
Continuous Functions ◽  
Completely Regular ◽  
Regular Open ◽  
Quasi Ordering

Let S be a completely regular topological space. Let C(S) denote the set of bounded, real-valued, continuous functions on 5. It is well known that C(S) forms a distributive lattice under the ordinary pointwise joins and meets. For any distributive lattice L and any ideal I⊆L, a quasi-ordering of L can be defined as follows : f⊇g if, for all h ∈ L, f ∩ h ∈ I implies g ∩ h ∈ I. If equivalent elements under this quasi-ordering are identified, a homomorphic image of L is obtained.

scholarly journals Congruence lattices of regular semigroups related to kernels and traces

1991 ◽  
Vol 34 (2) ◽  
pp. 179-203 ◽  
Author(s):  
Mario Petrich
Keyword(s):  
Distributive Lattice ◽  
Regular Semigroup ◽  
Homomorphic Image ◽  
Regular Semigroups ◽  
Generators And Relations ◽  
Congruence Lattices ◽  
Left And Right ◽  
Lattice Of Congruences

The kernel–trace approach to congruences on a regular semigroup S can be refined by introducing the left and right traces. This induces eight operators on the lattice of congruences on S: t1, k, tr,; Tt, K, Tr; t, T. We describe the lattice of congruences on S generated by six 3-element subsets of the set {ωt1, ωk, ωtr, εTt, εK, εTr} where ω and ε denote the universal and the equality relations. This is effected by means of a diagram and in terms of generators and relations on a free distributive lattice, or a homomorphic image thereof. We perform the same analysis for the lattice of congruences on S generated by the set {εK, ωk, εT, ωt}.

The 𝒞(X,D), a characterization of a Stone almost distributive lattice

2015 ◽  
Vol 08 (03) ◽  
pp. 1550055
Author(s):  
Ch. Santhi Sundar Raj ◽  
K. Rama Prasad ◽  
M. Santhi ◽  
R. Vasu Babu
Keyword(s):  
Distributive Lattice ◽  
Homomorphic Image ◽  
Maximal Element ◽  
Continuous Functions ◽  
Boolean Space

We prove that for any Boolean space [Formula: see text] and a dense Almost Distributive Lattice (ADL) [Formula: see text] with a maximal element, the set [Formula: see text] of all continuous functions of [Formula: see text] into the discrete [Formula: see text] is a Stone ADL. Conversely, it is proved that any Stone ADL is a homomorphic image of [Formula: see text] for a suitable Boolean space [Formula: see text] and a dense ADL [Formula: see text] with a maximal element.

Sign in / Sign up

Export Citation Format

Share Document