Related papers: On distributive join-semilattices

An FN lattice $F$ is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J.\,B. Nation. Let $\mathsf{B}_n$ denote the Boolean lattice with $n$ atoms. For a lattice $K$, let $K^+$ denote $K$ with…

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

Associated with any composition beta=(a,b,...) is a corresponding fence poset F(beta) whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... The distributive lattice L(beta) of all lower order…

We prove that for the intermediate logics with the disjunction property any basis of admissible rules can be reduced to a basis of admissible m-rules (multiple-conclusion rules), and every basis of admissible m-rules can be reduced to a…

Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our…

In this paper, we construct a new homology theory for semi-groups satisfying the self distributivity axiom or the idempotency axiom. Next, we consider the geometric realization corresponding to the homology theory. We continue with the…

The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…

If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…

Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…

We represent finite join-semilattices and join-preserving morphisms as a category whose objects and morphisms are binary relations. It is a quotient category of $\mathsf{Rel}_f$'s arrow category, where self-duality arises by taking the…

Equations over linearly ordered semilattices are studied. For any equation $t(X)=s(X)$ we find irreducible components of its solution set and compute the average number of irreducible components of all equations in $n$ variables.

Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of…

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…

We prove that for any distributive join-semilattice S, there are a meet-semilattice P with zero and a map f:PxP-->S such that f(x,z)<=f(x,y)vf(y,z) and x<=y implies that f(x,y)=0, for all x,y,z in P, together with the following conditions:…

We consider random Hermitian matrices with independent upper triangular entries. Wigner's semicircle law says that under certain additional assumptions, the empirical spectral distribution converges to the semicircle distribution. We…

We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…

Let L be a join-distributive lattice with length n and width(Ji L) \leq k. There are two ways to describe L by k-1 permutations acting on an n-element set: a combinatorial way given by P.H. Edelman and R.E. Jamison in 1985 and a recent…

The homogeneous coordinate ring of a Schubert variety (a Schubert cycle for short) is an algebra with straightening law generated by a distributive lattice. This paper gives a simple method to study the set of all the join-irreducible…

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…