Results 221 to 230 of about 12,906 (264)
Semigroup-theoretic analysis of supply-chain disruptions and resilience. [PDF]
PLoS OneOpue JA, Sampson MI, Tom OJ, Okorie UE.
europepmc +1 more source
Harmonic Control of Dynamical Freezing in Programmable Rydberg Atom Arrays
Ghosh R +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fuzzy Sets and Systems, 2009
The authors present an approach to fuzzification of complete lattices, which is a special kind of complete \(\Omega\)-lattices defined by Lai and Zhang. Tarski fixed-point theorem for the \(L\)-fuzzy complete lattices was proved in a different way. Some fuzzy powerset operators are suggested.
Qi-Ye Zhang, Weixian Xie, Lei Fan
exaly +3 more sources
The authors present an approach to fuzzification of complete lattices, which is a special kind of complete \(\Omega\)-lattices defined by Lai and Zhang. Tarski fixed-point theorem for the \(L\)-fuzzy complete lattices was proved in a different way. Some fuzzy powerset operators are suggested.
Qi-Ye Zhang, Weixian Xie, Lei Fan
exaly +3 more sources
Advances in Imaging and Electron Physics, 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.
Henk J A M Heijmans
exaly +3 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.
Henk J A M Heijmans
exaly +3 more sources
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 +2 more
exaly +2 more sources
Convexity on complete lattices
Soft Computing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongping Liu, Fu-Gui Shi
openaire +1 more source
Connectivity on Complete Lattices
Journal of Mathematical Imaging and Vision, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Double Approximation and Complete Lattices
Fundamenta Informaticae, 2009We explore lattice theoretic aspects in rough set theory in terms of the duality between algebra and representation. Approximation spaces are dual to complete atomic Boolean algebras in the sense that there is an adjunction between corresponding suitable categories.
Taichi Haruna, Yukio-Pegio Gunji
openaire +2 more sources
A COMPLETENESS THEOREM FOR CORRELATION LATTICES
Mathematical Logic Quarterly, 1983In this paper the authors study the varieties \(A_ n\), n fixed odd, of all Boolean correlation lattices. They obtain a characterization of simple algebras and prove that they are functionally complete; they also show that the variety \(A_ n\) is arithmetical.
Dietmar Schweigert, Magdalena Szymanska
openaire +2 more sources