Results 121 to 130 of about 84,600 (169)
Some of the next articles are maybe not open access.
Prime, irreducible, and completely irreducible lattice preradicals on modular complete lattices (I)
Journal of Algebra and Its Applications, 2021Based on the concept of a lattice preradical recently introduced in [T. Albu and M. Iosif, Lattice preradicals with applications to Grothendieck categories and torsion theories, J. Algebra 444 (2015) 339–366], we present and investigate in this paper, the latticial counterparts of the concepts of prime and irreducible preradicals on the category Mod ...
Albu, Toma +2 more
openaire +2 more sources
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.
Zhang, Qiye, Xie, Weixian, Fan, Lei
openaire +2 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.
Zhang, Qiye, Xie, Weixian, Fan, Lei
openaire +2 more sources
Journal of Applied and Industrial Mathematics, 2017
Summary: We study the properties of graphs that can be placed in a rectangular lattice so that all vertices located in the same (horizontal or vertical) row be adjacent. Some criterion is formulated for an arbitrary graph to be in the specified class.
Bessonov, Yu. E., Dobrynin, A. A.
openaire +1 more source
Summary: We study the properties of graphs that can be placed in a rectangular lattice so that all vertices located in the same (horizontal or vertical) row be adjacent. Some criterion is formulated for an arbitrary graph to be in the specified class.
Bessonov, Yu. E., Dobrynin, A. A.
openaire +1 more source
Canadian Journal of Mathematics, 1957
Let (X, ≤) be a partially ordered set, that is, X is a set and ≤ is a reflexive, anti-symmetric, transitive, binary relation on X.We write,for each x ∈ X. If, moreover,exists for each x and y in X, then (X, ≤) is said to be a semi-lattice.
openaire +2 more sources
Let (X, ≤) be a partially ordered set, that is, X is a set and ≤ is a reflexive, anti-symmetric, transitive, binary relation on X.We write,for each x ∈ X. If, moreover,exists for each x and y in X, then (X, ≤) is said to be a semi-lattice.
openaire +2 more sources
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
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.
Haruna, Taichi, Gunji, Yukio-Pegio
openaire +2 more sources
Connectivity on Complete Lattices
Journal of Mathematical Imaging and Vision, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source