Results 261 to 270 of about 98,608 (306)
Complete intersection lattice ideals [PDF]
Journal of Algebra, 2005 In this paper we completely characterize lattice ideals that are complete intersections or equivalently complete intersections finitely generated semigroups of Z(n) circle plus T with no invertible elements, where T is a finite abelian group.
Apostolos Thoma
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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.
Qi-Ye Zhang, Weixian Xie, Lei Fan
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
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
On Convergence of Sequences in Complete Lattices
Order, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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