Related papers: Complete relations on fuzzy complete lattices
Given a reference lattice, we define fuzzy intervals to be the fuzzy sets such that their p-cuts are crisp closed intervals. We show that: given a complete reference lattice, the collection of its fuzzy intervals is a complete lattice.…
Our approach establishes a natural correspondence between complete orthomodular lattices and certain types of quantales. Firstly, given a complete orthomodular lattice X, we associate with it a Foulis quantale Lin(X) consisting of its…
By the means of lower and upper fuzzy approximations we define quasiorders. Their properties are used to prove our main results. First, we characterize those pairs of fuzzy sets which form fuzzy rough sets w.r.t. a t-similarity relation…
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…
The main results of the paper points out the connection between the weak ordered relations and factor lattices defined by tolerances. It is proved that for any tolerance $T$ of a lattice $L$ the Dedekind-Mac Neille completion of $L/T$ is…
We present generalization of the Bloom variety theorem of ordered algebras in fuzzy setting. We introduce algebras with fuzzy orders which consist of sets of functions which are compatible with particular binary fuzzy relations called fuzzy…
Given a family of continuous real functions $\mathcal{G}$, let $R_\mathcal{G}$ be a binary relation defined as follows: a continuous function $f\colon\mathbb{R}\to\mathbb{R}$ is in the relation with a closed set $E\subseteq\mathbb{R}$ if…
In fairly elementary terms this paper presents how the theory of preordered fuzzy sets, more precisely quantale-valued preorders on quantale-valued fuzzy sets, is established under the guidance of enriched category theory. Motivated by…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We prove that a tolerance relation of a lattice is a homomorphic image of a congruence relation.
Zilber's Theorem states that a finite lattice $L$ is planar if{}f it has a complementary order relation. We provide a new proof for this crucial result and discuss some applications, including a canonical form for finite planar lattices and…
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this…
Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…
In this paper, the definition of fuzzy rough relation on a set will be introduced and then it would be proved that the collection of such relations is closed under different binary compositions such as, algebraic sum, algebraic product etc.…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
In this paper, based on ideals, we investigate residuated lattices from fuzzy set theory and lattice theory point of view. Ideals are important concepts in the theory of algebraic structures used for formal fuzzy logic and first, we…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
We study the semantics of fuzzy if-then rules called fuzzy attribute implications parameterized by systems of isotone Galois connections. The rules express dependencies between fuzzy attributes in object-attribute incidence data. The…