We introduce the concept of a ⊗-closed set and a ⊗-homomorphism in lattice implication algebras, and we discuss some of their properties. Next, we introduce the fuzzy implicative filter and obtain equivalent conditions. Finally, we discuss the operation ⊗, fuzzy filters, and fuzzy implicative filters. 2000 Mathematics Subject Classification. 03G10, 06B10, 94D05.

The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice.

Let E be a vector lattice, $$\lambda _1,\lambda _2,\ldots ,\lambda _k$$ scalars and $$\varphi _1,\ldots ,\varphi pairwise independent regular linear functionals on E. We show that if $$k<m$$ then $$\sum _{j=1}^k\lambda _j\varphi _j^m$$ is orthogonally additive only _j$$ or $$-\varphi lattice homomorphism for each j, $$1\le j\le k$$ . Moreover, $$m\ge 2$$ , we provide an example to this result d...

The notion of acceptability is a counterpart of the phenomenon observed in our daily argumentation and originates from an old saying, “The one who has the last word laughs best”, as stated by Dung. It is an empirical social truth or wisdom that has been evolved in various cultural sphere over generations and considered useful by people. It is remarkable and suggestive that Dung’s theory of argu...

in this paper, we deal with molaei’s generalized groups. we definethe notion of a fuzzy generalized subgroup with respect to a t-norm (ort-fuzzy generalized subgroup) and give some related properties. especially,we state and prove the representation theorem for these fuzzy generalizedsubgroups. next, using the concept of continuity of t-norms we obtain a correspondencebetween tf(g), the set of ...

In Part I of this paper, we introduced a method of making two isomorphic intervals of a bounded lattice congruence equivalent. In this paper, we make one interval dominate another one. Let L be a bounded lattice, let [a, b] and [c, d] be intervals of L, and let φ be a homomorphism of [a, b] onto [c, d]. We construct a bounded (convex) extension K of L such that a congruence Θ of L has an extens...

Let R be a von Neumann algebra acting on a Hilbert space H and let Rsa be the set of hermitean (i.e. selfadjoint) elements of R. It is well known that Rsa is a lattice with respect to the usual partial order ≤ if and only if R is abelian. We define and study a new partial order on Rsa, the spectral order ≤s, which extends ≤ on projections, is coarser than the usual one, but agrees with it on ab...

Let L → H be a lattice homomorphism and let a “readable” drawing of H be given. It is natural to make use of it to try getting a clear(er) drawing of L. Hence, the following question is explored: How the knowledge of the congruence lattice Con(L) of L can help in getting “better” drawings of L? This will be done by proposing rank shelling procedures of (M(Con(L),≤) and will be illustrated with ...

We begin by recalling the general theory of adjoints on finite semilattices. A finite join semilattice with 0 is a lattice, with the naturally induced meet operation. Thus a finite lattice S can be regarded as a semilattice in two ways, either S = 〈S,+, 0〉 or S = 〈S,∧, 1〉. Given a (+, 0)-homomorphism g : S → T , define the adjoint h : T → S by h(t) = ∑ {s ∈ S : gs ≤ t} so that gs ≤ t iff s ≤ ht...

In this paper, the notions of fuzzy soft subalgebra and fuzzy soft convex subalgebra of a residuated lattice are introduced and some related properties are investigated. Then, we define fuzzy soft congruence on a residuated lattice and obtain the relation between fuzzy soft convex subalgebras and fuzzy soft congruence relations on residuated lattices. The concept of soft homomorphism is defined...