Results 151 to 160 of about 184 (184)
Some of the next articles are maybe not open access.
Decompositions in Complete Lattices
Algebra and Logic, 2001A series of results on the existence of various kinds of decompositions in upper continuous lattices, lower continuous lattices, and some other types of lattices are proven.
openaire +2 more sources
On Convergence of Sequences in Complete Lattices
Order, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Free Distributive Completions of Partial Complete Lattices
Order, 1997First the author gives some basic definitions and further provides a description of embedding of partial complete lattices in suitable concept lattices and its use in concept exploration. He discusses in which sense these concept lattices are freely generated by the partial complete lattices ``in the most distributive way''.
openaire +2 more sources
Characterizations of Complete Sublattices of a Given Complete Lattice
Southeast Asian Bulletin of Mathematics, 2001Let \(L\) be a complete lattice. A mapping \(\varphi\) of \(L\) into itself is called a closure operator if \(\varphi (x)\geq x\) and \(\varphi (\varphi ( x))=\varphi (x)\) for all \(x\in X\) and \(\varphi (x)\leq\varphi (y)\) whenever \(x\leq y\) for all \(x,y\in L\). The dual notion is that one of a kernel operator.
openaire +1 more source
OWA Operators on Complete Lattices
IEEE Transactions on Fuzzy Systems, 2018Considering some aggregation functions, we define ${\bf B}$ - $ A$ -weighting vectors. Then, a definition for ordered weighted average (OWA) operators is given based on ${\bf B}$ - $ A$ -weighting vectors. Moreover, we show that our proposed definition for OWA operators over complete lattices is a generalization of the given definition by ...
Radko Mesiar +3 more
openaire +1 more source
On Normed Lattices and Their Banach Completions
Positivity, 2005The authors prove that the countable interpolation property and the sequential order completeness are preserved under Banach completion. The paper makes use of a new technique for representation of normed lattices.
Koldunov, A. V., Veksler, A. I.
openaire +1 more source
2020
The theory of complete lattices is described in the language of set theory. The use of Hasse diagrams to represent finite lattices is described. Boolean lattices are defined and de Morgan's Laws are introduced. Regular closed sets are studied as an example of such lattices. Boolean functions and their representations are defined.
openaire +2 more sources
The theory of complete lattices is described in the language of set theory. The use of Hasse diagrams to represent finite lattices is described. Boolean lattices are defined and de Morgan's Laws are introduced. Regular closed sets are studied as an example of such lattices. Boolean functions and their representations are defined.
openaire +2 more sources
Logical operators on complete lattices
Information Sciences, 1991A concept of consistency among logical operators is given with a criterion to decide whether a group of logical operators is suitable for fuzzy reasoning. Also, a necessary and sufficient condition for a kind of logical operators on \([0,1]\) is obtained.
Ma Zherui, Wu Wangming
openaire +1 more source
Deresiduums of implications on a complete lattice
Information Sciences, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yong Su 0001, Zhudeng Wang
openaire +2 more sources
Completions of countable excellent domains and countable noncatenary domains
Journal of Algebra, 2021TERESA Yu, S Loepp
exaly