幂等扩张的有界分配格

考察了扩张的有界分配格类eD即带有自同态k的有界分配格,研究了具有幂等性的eD-代数的表示、同余关系以及次直不可约性,证明了这样的代数类有5个互不同构的次直不可约的幂等扩张的有界分配格。     

Relative separation in distributive congruence lattices

In [5] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety and the structure of subdirectly irreducible algebras in Now we generalize these results using the concept of relatively separable sets (with respect to subsets) and apply them to some lattice varieties.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived November 29, 2002; accepted in final form August 19, 2004.     

Subdirectly irreducible and free Kleene-Stone algebras

A Kleene-Stone algebra is a bounded distributive lattice with two unary operations that make it a Kleene and a Stone algebra. In this paper, we determine all subdirectly irreducible Kleene-Stone algebras, and describe the free Kleene-Stone algebra on a finite set of generators as a product of certain free Kleene algebras endowed with a Stone negation.Presented by J. Berman.     

Varieties of interlaced bilattices

The paper contains some algebraic results on several varieties of algebras having an (interlaced) bilattice reduct. Some of these algebras have already been studied in the literature (for instance bilattices with conflation, introduced by M. Fitting), while others arose from the algebraic study of O. Arieli and A. Avron??s bilattice logics developed in the third author??s PhD dissertation. We extend the representation theorem for bounded interlaced bilattices (proved, among others, by A. Avron) to unbounded bilattices and prove analogous representation theorems for the other classes of bilattices considered. We use these results to establish categorical equivalences between these structures and well-known varieties of lattices.     

Subdirectly irreducible commutative multiplicatively idempotent semirings

Commutative multiplicatively idempotent semirings were studied by the authors and F. ?vr?ek, where the connections to distributive lattices and unitary Boolean rings were established. The variety of these semirings has nice algebraic properties and hence there arose the question to describe this variety, possibly by its subdirectly irreducible members. For the subvariety of so-called Boolean semirings, the subdirectly irreducible members were described by F. Guzmán. He showed that there were just two subdirectly irreducible members, which are the 2-element distributive lattice and the 2-element Boolean ring. We are going to show that although commutative multiplicatively idempotent semirings are at first glance a slight modification of Boolean semirings, for each cardinal n > 1, there exist at least two subdirectly irreducible members of cardinality n and at least 2ⁿ such members if n is infinite. For \({n \in \{2, 3, 4\}}\) the number of subdirectly irreducible members of cardinality n is exactly 2.     

Distributive lattices with a decidable monadic second order theory

A class of finite distributive lattices has a decidable monadic second order theory iff (a) the join irreducible elements of its members have a decidable monadic second order theory, and (b) the width of the lattices is bounded. Similar results are obtained for the monadic chain and the monadic antichain theory where quantification is restricted to chains and antichains, resp. Furthermore, there is no (up to finite difference) maximal set of finite distributive lattices with a decidable monadic (chain or antichain, resp.) theory. Received December 6, 2000; accepted in final form May 30, 2002.     

对称扩展的有界分配格的同余关系及其应用

给出了对称扩展的有界分配格的定义,即带有满足一定条件的一元运算的有界分配格.然后给出了这种分配格上的主同余的等式刻划及其可补性.最后,讨论了对称扩展的有界分配格的次直不可约性。     

Iterative separation in distributive congruence lattices

In [PLOŠČICA, M.: Separation in distributive congruence lattices, Algebra Universalis 49 (2003), 1–12] we defined separable sets in algebraic lattices and showed a close connection between the types of non-separable sets in congruence lattices of algebras in a finitely generated congruence distributive variety and the structure of subdirectly irreducible algebras in . Now we generalize these results using the concept of separable mappings (defined on some trees) and apply them to some lattice varieties. Supported by VEGA Grants 2/4134/24, 2/7141/27, and INTAS Grant 03-51-4110.     

Commuting double Ockham algebras

In this paper,we study a certain class of double Ockham algebras (L;∧,∨,f,k,0,1), namely the bounded distributive lattices (L;∧,∨,0,1) endowed with a commuting pair of unary op- erations f and k,both of which are dual endomorphisms.We characterize the subdirectly irreducible members,and also consider the special case when both (L;f) and (L;k) are de Morgan algebras.We show via Priestley duality that there are precisely nine non-isomorphic subdirectly irreducible members, all of which are simple.     

Computational complexity for bounded distributive lattices with negation

We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal logic.     

Remarks on Priestley duality for distributive lattices

The notion of a Priestley relation between Priestley spaces is introduced, and it is shown that there is a duality between the category of bounded distributive lattices and 0-preserving join-homomorphisms and the category of Priestley spaces and Priestley relations. When restricted to the category of bounded distributive lattices and 0-1-preserving homomorphisms, this duality yields essentially Priestley duality, and when restricted to the subcategory of Boolean algebras and 0-preserving join-homomorphisms, it coincides with the Halmos-Wright duality. It is also established a duality between 0-1-sublattices of a bounded distributive lattice and certain preorder relations on its Priestley space, which are called lattice preorders. This duality is a natural generalization of the Boolean case, and is strongly related to one considered by M. E. Adams. Connections between both kinds of dualities are studied, obtaining dualities for closure operators and quantifiers. Some results on the existence of homomorphisms lying between meet and join homomorphisms are given in the Appendix.     

A categorical equivalence for bounded distributive quasi lattices satisfying: x ∨ 0 = 0 ⇒ x = 0

In this work, we investigate a categorical equivalence between the class of bounded distributive quasi lattices that satisfy the quasiequation x∨0 = 0 =? x = 0, and a category whose objects are sheaves over Priestley spaces.     

Subdirectly Irreducible Double Demi-p-Lattices

The aim of this paper is to give a characterization of the (finitely) subdirectly irreducible double demi-p-lattices. First, we prove a congruence representation theorem for double demi-p-lattices, which is a natural analogue of the theorem given in [2] for double p-algebras. These results are inspired by the representation theorem given by Lakser [6] for p-algebras, and yield a natural approach to the study of subdirectly irreducible algebras.     

Remarks on affine complete distributive lattices

We characterise the Priestley spaces corresponding to affine complete bounded distributive lattices. Moreover we prove that the class of affine complete bounded distributive lattices is closed under products and free products. We show that every (not necessarily bounded) distributive lattice can be embedded in an affine complete one and that ℚ ∩ [0, 1] is initial in the class of affine complete lattices.     

Separation in distributive congruence lattices

We define separable sets in algebraic lattices. For a finitely generated congruence distributive variety V \mathcal{V} , we show a close connection between non-separable sets in congruence lattices of algebras in V \mathcal{V} and the structure of subdirectly irreducible algebras in V \mathcal{V} . We apply the general results to some lattice varieties.     

Congruences on near-Heyting algebras

A near-Heyting algebra is a join-semilattice with a top element such that every principal upset is a Heyting algebra. We establish a one-to-one correspondence between the lattices of filters and congruences of a near-Heyting algebra. To attain this aim, we first show an embedding from the lattice of filters to the lattice of congruences of a distributive nearlattice. Then, we describe the subdirectly irreducible and simple near-Heyting algebras. Finally, we fully characterize the principal congruences of distributive nearlattices and near-Heyting algebras. We conclude that the varieties of distributive nearlattices and near-Heyting algebras have equationally definable principal congruences.     

Congruence distributive quasivarieties whose finitely subdirectly irreducible members form a universal class

By a congruence distributive quasivariety we mean any quasivarietyK of algebras having the property that the lattices of those congruences of members ofK which determine quotient algebras belonging toK are distributive. This paper is an attempt to study congruence distributive quasivarieties with the additional property that their classes of relatively finitely subdirectly irreducible members are axiomatized by sets of universal sentences. We deal with the problem of characterizing such quasivarieties and the problem of their finite axiomatizability.Presented by Joel Berman.To the memory of Basia Czelakowska.