Considering a commutative unital quantale L as the truth value table and using the tool of L-generalized convergence structures of stratified L-filters, this paper introduces a kind of fuzzy upper topology, called fuzzy S-upper topology, on L-preordered sets. It is shown that every fuzzy join-preserving L-subset is open in this topology. When L is a complete Heyting algebra, for every completel...

the aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. all values aretaken in a fixed frame $l$. a definition of (strongly) completelydistributive $l$-ordered sets is introduced. the main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $l$-ordereds...

The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...

In the late 1930's Garrett Birkhoff [3] pioneered the theory of distributive lattices. An important component in this theory is the concept of exponentiation of lattices [4]: for a lattice L and a partially ordered set P let L denote the set of all order-preserving maps of P to L partially ordered b y / ^ g if and only if/(;c) ^ g(x) for each x e P (see Figure 1). Indeed, If is a lattice. This ...

An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n2 log2 n), where n = |L|. This paper is motivated by the problem of efficiently calculating and representing the congruence lattice Con L of a finite lattice L. Of c...

This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, this reduces to the idempotent semiring-based CSP approach, and the lattice operations can be used to define a sound and complete proof theory. For the general case, it is shown how sound and complete deduction can be p...

Brouwerian ordered sets generalize Brouwerian lattices. The aim of this paper is to characterize α-complete Brouwerian ordered sets in a manner similar to that used previously for pseudocomplemented, Stone, Boolean and distributive ordered sets. The sublattice G(P ) in the Dedekind-Mac Neille completion DM(P ) of an ordered set P generated by P is said to be the characteristic lattice of P . We...

Let L denote a set of additive hereditary graph properties. It is a known fact that a partially ordered set (La,⊆) is a complete distributive lattice. We present results when a join of two additive hereditary graph properties in (La,⊆) has a finite or infinite family of minimal forbidden subgraphs.

Let L ∗ M denote the coproduct of the bounded distributive lattices L and M . At the 1981 Banff Conference on Ordered Sets, the following question was posed: What is the largest class L of finite distributive lattices such that, for every non-trivial Boolean lattice B and every L ∈ L, B ∗ L = B ∗ L′ implies L = L′? In this note, the problem is solved.