Results 221 to 230 of about 10,888 (264)

On lower bounded lattices

Algebra Universalis, 2001
The authors study the hierarchy of properties that define lower bounded lattices within the class of all finite lattices. A lattice \(L\) is lower bounded if any homomorphism \(h\) from a finitely generated lattice \(K\) into \(L\) is lower bounded, i.e.\ if \(\{ x\in K\); \(a\leq h(x) \}\) is either empty or has a least element whenever \(a\in h(K)\).
Adaricheva, K. V., Gorbunov, V. A.
openaire   +1 more source

Nullnorms on bounded lattices

Information Sciences, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Funda Karaçal, Mehmet Akif Ince, Radko Mesiar   +2 more
openaire   +1 more source

Subordinations on Bounded Distributive Lattices

Order, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Uninorms on bounded lattices

Fuzzy Sets and Systems, 2015
New methods for constructing uninorms on a bounded lattice \(L\) with a fixed neutral element ``\(e\)'' different from the bounds of \(L\) are given. For an arbitrary t-norm \(T\) on \([0, e]^2\), a related uninorm on \(L\) is defined. Similarly a related uninorm on \(L\) is made for an arbitrary t-conorm \(S\) on \([e, 1]^2\).
Funda Karaçal, Radko Mesiar
openaire   +2 more sources

Uni-nullnorms on bounded lattices

Fuzzy Sets and Systems, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ya-Ming Wang, Hang Zhan, Hua-Wen Liu
openaire   +2 more sources

Monadic Bounded Residuated Lattices

Order, 2011
Algebraic counterparts of the existential and universal quantifiers have been frequently studied for certain nonclassical logics. Monadic Boolean algebras, monadic MV-algebras, monadic Heyting algebras and monadic R\(\ell\)-monoids have been defined and studied.
Jirí Rachunek, Dana Salounová
openaire   +1 more source

Convolution on Bounded Lattices

2017
The union and intersection of two membership degrees of type-2 fuzzy sets are defined using a generalization of the mathematical operation of convolution. In the literature, it has been deeply studied when these convolution operations constitute a bounded distributive lattice.
Laura De Miguel, Humberto Bustince, Bernard De Baets   +2 more
openaire   +1 more source

THE LATTICE OF PERMUTATIONS IS BOUNDED

International Journal of Algebra and Computation, 2000
The purpose of this paper is to show that the lattice [Formula: see text] of permutations on a n -element set is bounded. This result strengthens the semi-distributive nature of the lattice [Formula: see text]. To prove this property, we use a characterization of the class of bounded lattices in terms of arrows relations defined on the join ...
openaire   +2 more sources

Representation of nullnorms on bounded lattices

Information Sciences, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiang-Rong Sun, Hua-Wen Liu
openaire   +1 more source

Lattice-based sum of uninorms on bounded lattices

2020 IEEE 18th International Symposium on Intelligent Systems and Informatics (SISY), 2020
The notion of a lattice-based sum of uninorms on bounded lattices is based on the notion of the n-uninorm (Akella 2007), and on the lattice-based sum of lattices (ElZekey et al. 2013). A lattice-based sum of lattices is a common generalization of both, horizontal as well as ordinal sum of lattices (Birkhoff 1963).
openaire   +1 more source