Related papers: Contact semilattices
Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algebras for the underlying functor of the monad subject to the…
We introduce the concept of a quasiresiduated lattice and prove that every lattice effect algebra can be organized into a commutative quasiresiduated lattice with divisibility. Also conversely, every such a lattice can be converted into a…
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, --The class of all finite…
We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the…
A method for constructing distributions on the non negative integers as discrete analogue of continuous distributions on the non negative real is presented. A justification of the definition of discrete self decomposable laws is provided.…
Quadratic Poisson brackets on a vector space equipped with a bilinear multiplication are studied. A notion of a bracket compatible with the multiplication is introduced and an effective criterion of such compatibility is given. Among…
This is an overview of the recent results of interaction of Boolean valued analysis and vector lattice theory.
We consider two constructions of an envelope for a finite locally distributive strong upper semilattice. The first is based on Birkhoff's representation of finite distributive lattices and the second on valuations on lattices. We show that…
In this expository article, we give a self-contained introduction to the wonderfully well-behaved class of pseudocompact algebras, focusing on the foundational classes of semisimple and separable algebras. We give characterizations of such…
Motivated by Gentzen disjunction elimination rule in his Natural Deduction calculus and reading inequalities with meet in a natural way, we conceive a notion of distributivity for join-semilattices. We prove that it is equivalent to a…
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…
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
We discuss the relationship between tight and cover-to-join representations of semilattices and inverse semigroups, showing that a slight extension of the former, together with an appropriate selection of co-domains, makes the two notions…
In this note we make several observations concerning symplectic fillings. In particular we show that a (strongly or weakly) semi-fillable contact structure is fillable and any filling embeds as a symplectic domain in a closed symplectic…
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
The class of weak BCK-algebras is obtained by weakening one of standard BCK axioms. It is known that every weak BCK-algebra is completely determined by the structure of its initial segments. We review several natural classes of commutative…
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…
Semi-entwining structures are proposed as concepts simpler than entwining structures, yet they are shown to have interesting applications in constructing intertwining operators and braided algebras, lifting functors, finding solutions for…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…