Results 231 to 240 of about 89,389 (268)
Some of the next articles are maybe not open access.
The Complete Congruence Lattice of a Complete Lattice
1990G. Birkhoff [1] raised the following question in 1945: Is every complete lattice isomorphic to the lattice of congruence relations of a suitable (infinitary) algebra? In 1948, Birkhoff restated this question in the Second Edition of his Lattice Theory [2]; however, “(infinitary)” was dropped from the question. This was intentional; G. Birkhoff referred
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
Lattice-valued spaces: ⊤-Completions
Fuzzy Sets and Systems, 2019Abstract The concept of a ⊤-Convergence space has recently been introduced and studied. These spaces are related to the top level space of a lattice-valued convergence space. In order to consider completions, ⊤-Cauchy spaces are defined and investigated in the present work.
Lyall Reid, Gary Richardson
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
On the Structure of the Completion of a Normed Lattice
Positivity, 2006This is a detailed study of a few subtle properties of the norm completion of a normed vector lattice \(X\). Special emphasis is put on the properties of the largest ideal in \(X\) enjoying the condition \(A_o\).
Koldunov, Andrew V. +1 more
openaire +2 more sources
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
Approximation operators on complete completely distributive lattices
Information Sciences, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Keyun Qin +3 more
openaire +2 more sources