Results 211 to 220 of about 3,104 (252)
Completely lattice L-ordered sets with and without L-equality
Fuzzy Sets and Systems, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martinek, Pavel, Pavel Martinek
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Ordered sets, lattices, and universal algebra
1994Abstract It is of course impossible to give a full account of ordered sets, lattices, and universal algebra in a few pages, so we refer the reader to the various books cited in the bibliography. Nevertheless, in order to make this monograph reasonably selfcontained, we shall summarise in this introductory chapter the fundamental notions ...
T S Blyth, J C Varlet
exaly +2 more sources
Large Sets of Lattices without Order Embeddings [PDF]
Communications in Algebra, 2015 Let I and μ be an infinite index set and a cardinal, respectively, such that |I| ≤ μ and, starting from ℵ0, μ can be constructed in countably many steps by passing from a cardinal λ to 2λ at successor ordinals and forming suprema at limit ordinals. We prove that there exists a system X = {Li: i ∈ I} of complemented lattices of cardinalities less than ...
Czédli Gábor
openaire +3 more sources
, 1989 This book is another publication in the recent surveys of ordered sets and lattices. The papers, which might be characterized as "reviews of reviews," are based on articles reviewed in the Referativnyibreve Zhurnal: Matematika from 1978 to 1982.
Kh. Drashkovicheva +7 more
openaire +2 more sources
Applied Soft Computing, 2015
Graphical abstractDisplay Omitted HighlightsConcept of lattice ordered soft sets is introduced.This type of soft sets can help to represent linguistic terms having certain order.Properties of lattice order soft sets have been studied.Some algebraic structures associated with this type of soft sets have been given.In certain decision making problems ...
Muhammad Irfan Ali +3 more
openaire +1 more source
Graphical abstractDisplay Omitted HighlightsConcept of lattice ordered soft sets is introduced.This type of soft sets can help to represent linguistic terms having certain order.Properties of lattice order soft sets have been studied.Some algebraic structures associated with this type of soft sets have been given.In certain decision making problems ...
Muhammad Irfan Ali +3 more
openaire +1 more source
, 1992 This indispensable reference source contains a wealth of information on lattice theory. The book presents a survey of virtually everything published in the fields of partially ordered sets, semilattices, lattices, and Boolean algebras that was reviewed ...
Draskovicova, H +2 more
openaire +2 more sources
The Lattice of Completions of an Ordered Set
Order, 1997The join dense completions of an ordered set \(P\) form a complete lattice \(K(P)\). Its least element is \(\mathcal O(P)\), the lattice of all order ideals of \(P\), and its greatest element is \(\mathcal M(P)\), the Dedekind-MacNeille completion of \(P\). It is isomorphic to an ideal of the lattice of all closure operators on \(\mathcal O(P)\).
Nation, J. B., Pogel, Alex
openaire +2 more sources
Lattices of Order-Convex Sets of Forests
Order, 2009Let \((P,\leq)\) be a partially ordered set. A set \(A\subseteq P\) is order-convex if for any \(x,y\in A\), \(x \leq z\leq y\) implies that \(z\in A\). Let \(\mathbf{Co}(P)\) denote the lattice of convex subsets of \(P\) under inclusion; such lattices will be called convexity lattices. For a class \(\mathcal{K}\) of posets, let \(\mathbf{Co}(\mathcal {
Marina V. Semenova +1 more
openaire +1 more source
ON LATTICES EMBEDDABLE INTO LATTICES OF ORDER-CONVEX SETS: CASE OF TREES
International Journal of Algebra and Computation, 2007We find a syntactic characterization of the class of lattices embeddable into convexity lattices of posets which are trees. The characterization implies that this class forms a finitely based variety.
Marina V. Semenova +1 more
openaire +1 more source
Endomorphism Classes of Ordered Sets, Graphs and Lattices
Order, 1998Mathematical structures of a certain type with an underlying set \(X\) are considered; they form the class \(C\). If \(S\in C\), then \(\text{End} S\) is the set of endomorphisms of \(S\). The following question is considered: Which structures \(S'\in C\) on the set \(X\) have the property that \(\text{End} S\subseteq\text{End} S'\)? If for some \(S\in
Gibson, Peter, Zaguia, Imed
openaire +1 more source