Given a ∨ -complete (semi)lattice L, we consider L-labeled transition systems as coalgebras of a functor L(−), associating with a set X the set LX of all L-fuzzy subsets. We describe simulations and bisimulations of L-coalgebras to show that L(−) weakly preserves nonempty kernel pairs iff it weakly preserves nonempty pullbacks iff L is join infinitely distributive (JID). Exchanging L for a comm...

The purpose of this paper is to prove a correlation inequality for n increasing functions on a distributive lattice. For finite lattices, it is possible to combine the entire family of inequalities (for all n) into a single statement involving the ring of formal power series. This is the form in which we first formulate and prove our result. Thus, let X be a finite set and regard the power set ...

The aim of this paper is to extend the truth value table oflattice-valued convergence spaces to a more general case andthen to use it to introduce and study the quantale-valued fuzzy Scotttopology in fuzzy domain theory. Let $(L,*,varepsilon)$ be acommutative unital quantale and let $otimes$ be a binary operationon $L$ which is distributive over nonempty subsets. The quadruple$(L,*,otimes,varep...

Let L be a bounded distributive lattice. For k 1, let Sk (L) be the lattice of k-ary functions on L with the congruence substitution property (Boolean functions); let S(L) be the lattice of all Boolean functions. The lattices that can arise as Sk (L) or S(L) for some bounded distributive lattice L are characterized in terms of their Priestley spaces of prime ideals. For bounded distributive lat...

Given two complete atomistic lattices L 1 and L 2 , we define a set S = S(L 1 , L 2) of complete atomistic lattices by means of four axioms (natural regarding the logic of compound quantum systems), or in terms of a universal property with respect to a given class of bimorphisms (Th. 3.3). S is a complete lattice (Th. 0.10). The bottom element L 1 ∧ L 2 is the separated product of Aerts [1]. Fo...

We mean by a normal form a finite set of ordered pairs of subsets of a fixed set that fulfils two conditions: elements of it consist of disjoint sets and elements of it are incomparable w.r.t. inclusion. The underlying set corresponds to a set of propositional variables but is arbitrary. The correspodents to a normal form of a formula, e.g. a disjunctive normal form, is as follows. The normal f...

By a new partial ordering relation “ ≤ ” the set of convex sublattices CS(L) of a lattice L is again a lattice. In this paper we establish some results on the pseudocomplementation of (CS(L); ≤). We show that a lattice L with 0 is dense if and only if CS(L) is dense. Then we prove that a finite distributive lattice is a Stone lattice if and only if CS(L) is Stone. We also prove that an upper co...

based on a complete heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a cartesian-closed category, calledthe category of $l-$ordered fuzzifying convergence spaces, in whichthe category of $l-$fuzzifying topological spaces can be embedded.in addition, two new categories are introduced, which are called the...

If L is a lattice, the automorphism group of L is denoted Aut(L). It is known that given a finite abstract group H, there exists a finite distributive lattice D such that Aut(D) £= H. It is also known that one cannot expect to find a finite orthocomplemented distributive (Boolean) lattice B such that Aut(B) s= H. In this paper it is shown that there does exist a finite orthomodular lattice L su...