Abstract We address the following rainbow Ramsey problem: For posets P , Q what is smallest number n such that any coloring of elements Boolean lattice B either admits a monochromatic copy or . consider both weak and strong (non-induced induced) versions this problem.

The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the Mizar Mathematical Library, there are some attempts to formalize prime ideals and filters; one series of articles written as decoding [9] proven some results; we tried however to follow [21], [12], and [13]. All three were devoted to the Stone repr...

We show that a commutative bounded integral orthomodular lattice is residuated iff it is a Boolean algebra. This result is a consequence of [7, Theorem 7.31]; however, our proof is independent and uses other instruments.

In order to research the logical system whose propositional value is given in a lattice from the semantic viewpoint, Xu [7] proposed the concept of lattice implication algebras, and discussed some of their properties. Xu and Qin [8] introduced the notion of implicative filters in a lattice implication algebra, and investigated some of their properties. Turunen [5] introduced the notion of Boole...

This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...

Obviously each lattice that satisfies either (JID) or (MID) is distributive. A classic result in lattice theory is Funayama’s theorem [5] stating that there is an embedding e of L into a complete Boolean algebra B that preserves all existing joins and meets in L iff L satisfies both (JID) and (MID). Funayama’s original proof was quite involved. For complete L, Grätzer [6, Sec. II.4] gave a more...

Introduction. For'several years one of the outstanding problems of lattice theory has been the following: Is every lattice with unique complements a Boolean algebra? Any number of weak additional restrictions are sufficient for an affirmative answer. For example, if a lattice is modular (G. Bergman [l](1)) or ortho-complemented (G. Birkhoff [l]) or atomic (G. Birkhoff and M. Ward [l]), then uni...

Let L be a finite pseudocomplemented lattice. Every interval [0, a] in L is pseudocomplemented, so by Glivenko’s theorem, the set S(a) of all pseudocomplements in [0, a] forms a boolean lattice. Let Bi denote the finite boolean lattice with i atoms. We describe all sequences (s0, s1, . . . , sn) of integers, for which there exists a finite pseudocomplemented lattice L with si = |{ a ∈ L | S(a) ...

COMPOSITIONS OF SPECIES STEFAN FORCEY Abstract. An extension of the Tamari lattice to the multiplihedra is discussed, along with projections to the composihedra and the Boolean lattice. The multiplihedra and composihedra are sequences of polytopes that arose in algebraic topology and category theory. Here we describe them in terms of the composition of combinatorial species. We de ne lattice st...