Related papers: Embeddings into the countable atomless Boolean alg…
We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
We streamline and generalize the recent progress in understanding entanglement between spatial regions in Abelian gauge theories. We provide an unambiguous and explicit prescription for calculating entanglement entropy in a $\mathbb Z_N$…
We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…
A subalgebra $\mathcal{A}$ of a $C^*$-algebra $\mathcal{M}$ is logmodular (resp. has factorization) if the set $\{a^*a; a\text{ is invertible with }a,a^{-1}\in\mathcal{A}\}$ is dense in (resp. equal to) the set of all positive and…
Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…
In this paper we generalize the well known relation between Heyting algebras and Nelson algebras in the framework of subresiduated lattices. In order to make it possible, we introduce the variety of subresiduated Nelson algebras. The main…
In this paper we introduce the notion of existentially closed Leibniz algebras. Then we use HNN-extensions of Leibniz algebras in order to prove an embedding theorem.
In this paper we study the lattice of restricted subalgebras of a restricted Lie algebra. In particular, we consider those algebras in which this lattice is dually atomistic, lower or upper semimodular, or in which every restricted…
We present an easy construction producing a Kleene lattice K from an arbitrary distributive lattice L and a non-empty subset of L. We show that L can be embedded into K and compute the cardinality of K under certain additional assumptions.…
On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…
In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…
It is shown that there exists a complete, atomless, sigma-centered Boolean algebra, which does not contain any regular countable subalgebra if and only if there exist a nowhere dense ultrafilter. Therefore the existence of such algebras is…
In this paper we begin to study the subalgebra lattice of a Leibniz algebra. In particular, we deal with Leibniz algebras whose subalgebra lattice is modular, upper semi-modular, lower semi-modular, distributive, or dually atomistic. The…
The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…
We examine the properties of algebras of linear transformations that leave invariant all subspaces in a totally ordered lattice of subspaces of an arbitrary vector space. We compare our results with those that apply for the corresponding…
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
Given a Boolean algebra B and an embedding e:B -> P(N)/fin we consider the possibility of extending each or some automorphism of B to the whole P(N)/fin. Among other things, we show, assuming CH, that for a wide class of Boolean algebras…
We show that one can formulate an algebra with lattice ordering so as to contain one quantum and five classical operations as opposed to the standard formulation of the Hilbert space subspace algebra. The standard orthomodular lattice is…
Given k sets such that no one is contained in another, there is an associated lattice on the power set P([k]) corresponding to inclusion relations among unions of the sets. Two lattices on P([k]) are equivalent if there is a permutation of…