Results 51 to 60 of about 84,600 (169)
Jurnal Sains Dasar, 2017 A complete idempotent semiring has a structure which is called a complete lattice. Because of the same structure as the complete lattice then inequality of the complete idempotent semiring can be solved a solution by using residuation theory.
Eka Susilowati, Ari Suparwanto
doaj
Pawlak Algebra and Approximate Structure on Fuzzy Lattice
The Scientific World Journal, 2014 The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering.
Ying Zhuang +3 more
doaj +1 more source
Weak Compactness of Almost Limited Operators
Journal of Function Spaces, 2014 This paper is devoted to the relationship between almost limited operators and weakly compact operators. We show that if F is a σ-Dedekind complete Banach lattice, then every almost limited operator T:E→F is weakly compact if and only if E is reflexive ...
Aziz Elbour +2 more
doaj +1 more source
Completely distributive latices [PDF]
Fundamenta Mathematicae, 1983 A map p from a complete lattice L to itself is said to \(\vee\)-define L, if \(a=\sup\{b|\) \(a\nleq p(b)\}\) for all a,\(b\in L\). The main result: A complete lattice is completely distributive if and only if there exists a map p:\(L\to L\) which \(\vee\)-defines L. Several examples are given and some known characterizations of completely distributive
openaire +1 more source
Journal of New Results in Science, 2012 Soft set theory was introduced by Molodtsov in 1999 as a general mathematical tool for dealing with problems that contain uncertainity. In this paper,we define concept of a soft lattice, soft sublattice, complete soft lattice, modular soft lattice ...
Faruk Karaaslan +2 more
doaj
Aggregation Functionals on Complete Lattices
Proceedings of the 7th conference of the European Society for Fuzzy Logic and Technology (EUSFLAT-2011), 2011 The aim of this paper is to introduce some classes of aggregation functionals when the evaluation scale is a complete lattice. Two different types of aggregation functionals are introduced and investigated. We consider a target-based approach that has been studied in Decision Theory and we focus on the equivalence between a utility-based approach and ...
openaire +4 more sources
H-Fuzzy Ideals and H-Fuzzy Filters in Distributive Join-Semilattices
Journal of MathematicsThis paper investigates H-fuzzy ideals of distributive join-semilattices with least element 0 whose codomain is a complete lattice that satisfies the infinite meet distributive law.
Mohammed Amare Mohammed +3 more
doaj +1 more source
CPSP-tools – Exact and complete algorithms for high-throughput 3D lattice protein studies
BMC Bioinformatics, 2008 Background The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. lattice proteins.
Will Sebastian +2 more
doaj +1 more source
Structure of completely distributive complete lattices
Indagationes Mathematicae (Proceedings), 1987 A lattice with 0 is called dense if 0 is meet-irreducible. The author proves the following simple theorem: If L is a non trivial dense complete chain, the lattice morphisms from L to I (the real unit interval, with the usual order) separate the points (for every ...
openaire +2 more sources
On the Complete Lattice Structure of Ordered Functional Weighted Averaging Operators
MathematicsOrdered functional weighted averaging (OFWA) operators are a generalization of the well-known ordered weighted averaging (OWA) operators in which functions, instead of single values, are considered as weights.
Roberto G. Aragón +3 more
doaj +1 more source