A partial lattice P is ideal-projective, with respect to a class C of lattices, if for every K ∈ C and every homomorphism φ of partial lattices from P to the ideal lattice of K, there are arbitrarily large choice functions f : P → K for φ that are also homomorphisms of partial lattices. This extends the traditional concept of (sharp) transferability of a lattice with respect to C. We prove the ...

In the present paper, the intuitionistic fuzzy LI -ideal theory in lattice implication algebras is further studied. Some new properties and equivalent characterizations of intuitionistic fuzzy LI -ideals are given. Representation theorem of intuitionistic fuzzy LI -ideal which is generated by an intuitionistic fuzzy set is established. It is proved that the set consisting of all intuitionistic ...

The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to ...

Let FΓ be a finite dimensional path algebra of a quiver Γ over a field F. Let L and R denote the varieties of all left and right FΓ-modules respectively. We prove the equivalence of the following statements. • The subvariety lattice of L is a sublattice of the subquasivariety lattice of L. • The subquasivariety lattice of R is distributive. • Γ is an ordered forest.

We generalize Reimer’s Inequality [6] (a.k.a the BKR Inequality or the van den Berg–Kesten Conjecture [1]) to the setting of finite distributive lattices. (MSC 60C05)

A flat of a matroid is cyclic if it is a union of circuits; such flats form a lattice under inclusion and, up to isomorphism, all lattices can be obtained this way. A lattice is a Tr-lattice if all matroids whose lattices of cyclic flats are isomorphic to it are transversal. We investigate some sufficient conditions for a lattice to be a Tr-lattice; a corollary is that distributive lattices of ...

Rough sets deal with the vagueness and granularity in information systems. Reference[3] discusses rough approximations on a complete completely distributive lattice(CCD lattice for short) and brings generalizations of rough sets into a unified framework. This paper is devoted to the discussion of the relationship between approximations and topologies on a CCD lattice. It is proved that the set ...

We discuss the question whether every finite interval in the lattice of all topologies on some set is isomorphic to an interval in the lattice of all topologies on a finite set – or, equivalently, whether the finite intervals in lattices of topologies are, up to isomorphism, exactly the duals of finite intervals in lattices of quasiorders. The answer to this question is in the affirmative at le...

In this paper, the concept of intuitionistic fuzzy soft sets is applied to residuated lattices. The notion of intuitionistic fuzzy soft filters of a residuated lattice is introduced and some related properties are investigated. Then the representations of generated intuitionistic fuzzy soft filters are established. We prove that the lattice of all intuitionistic fuzzy soft filters of a residuat...