Related papers: Complete Boolean algebras are Bousfield lattices
For a tensor triangulated category which is well generated in the sense of Neeman, it is shown that the collection of Bousfield classes forms a set. This set has a natural structure of a complete lattice which is then studied, using the…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
The global structure of the unbounded derived category of a truncated polynomial ring on countably many generators is investigated, via its Bousfield lattice. The Bousfield lattice is shown to have cardinality larger than that of the real…
Given a complete atomic Boolean algebra, we show there is a commutative BCK-algebra whose ideal lattice is that Boolean algebra. This result is shown to exist within a larger framework involving BCK-algebras of functions, whose ideals and…
It is known that exactly eight varieties of Heyting algebras have a model-completion, but no concrete axiomatisation of these model-completions were known by now except for the trivial variety (reduced to the one-point algebra) and the…
The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…
We prove that the category of unital hyperarchimedean vector lattices is equivalent to the category of Boolean algebras. The key result needed to establish the equivalence is that, via the Yosida representation, such a vector lattice is…
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…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
Using Ohkawa's theorem that the collection of Bousfield classes is a set, we perform a number of constructions with Bousfield classes. In particular, we describe a greatest lower bound operator; we also note that a certain subset DL of the…
In this article, we introduce a lattice congruence with respect to a nonempty ideal $I$ of a distributive lattice $L$ and a derivation $d$ on $L$ denoted by $\theta_I^d$. We investigate some necessary and sufficient conditions for the…
We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise…
In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…
The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…
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…
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
The article explores the arithmetic of multiplication as a model of many valued projective logic. It is demonstrated that closed numerical intervals within this framework constitute Heyting algebras. The conditions for these algebras to be…
We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…
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…
We define a class of algebras describing links of binary semi-isolating formulas on a set of realizations for a family of 1-types of a complete theory. These algebras include algebras of isolating formulas considered before. We prove that a…