Related papers: Embeddings into the countable atomless Boolean alg…
We characterize commutative idempotent involutive residuated lattices as disjoint unions of Boolean algebras arranged over a distributive lattice. We use this description to introduce a new construction, called gluing, that allows us to…
The set of Bousfield classes has some important subsets such as the distributive lattice $\mathbf{DL}$ of all classes $\langle E\rangle$ which are smash idempotent and the complete Boolean algebra $\mathbf{cBA}$ of closed classes. We…
In this note we give an axiomatization of Boolean algebras based on weakly dicomplemented lattices: an algebra $(L,\wedge,\vee,\tu)$ of type $(2,2,1)$ is a Boolean algebra iff $(L,\wedge,\vee)$ is a non empty lattice and $(x\wedge…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
Sachs showed that a Boolean algebra is determined by its lattice of subalgebras. We establish the corresponding result for orthomodular lattices. We show that an orthomodular lattice L is determined by its lattice of subalgebras Sub(L), as…
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…
We prove that an arbitrary countable dimensional Lie algebra over a field of characteristic $\neq 2$ that is locally of subexponential growth is embeddable in a finitely generated Lie algebra of subexponential growth.
We prove that order convergence on a Boolean algebra turns it into a compact convergence space if and only if this Boolean algebra is complete and atomic. We also show that on an Archimedean vector lattice, order intervals are compact with…
Let A be a finite set with at least two elements. The composition of two classes I and J of operations on A, is defined as the set of all compositions of functions in I with functions in J. This binary operation gives a monoid structure to…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
We discuss the lattice of cotorsion theories for abelian groups. First we show that the sublattice of the well-studied rational cotorsion theories can be identified with the well-known lattice of types. Using a recently developed method for…
Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…
Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…
In this article we introduce the study of the number of pairs of non-comparable elements in a distributive lattice $\L$. We give several tight lower and upper bounds for the number and give as an application the lattices precisely for which…
In this paper we prove that every recursively presented Lie algebra over a field which is a finite extention of its simple subfield can be embedded in a recursively presented Lie algebra defined by relations which are equalities of…
We show that the big Ramsey degree of the Boolean algebra with 3 atoms within the countable atomless Boolean algebra is infinite.
In this paper we investigate measures over bounded lattices, extending and giving a unifying treatment to previous works. In particular, we prove that the measures of an arbitrary bounded lattice can be represented as measures over a…
Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…
It is unprovable that every complete subalgebra of a countably closed complete Boolean algebra is countably closed.
Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…