lower semilattice
Смотреть что такое "lower semilattice" в других словарях:
Semilattice — In mathematics, a join semilattice (or upper semilattice) is a partially ordered set which has a join (a least upper bound) for any nonempty finite subset. Dually, a meet semilattice (or lower semilattice) is a partially ordered set which has a… … Wikipedia
Inverse semigroup — In mathematics, an inverse semigroup S is a semigroup in which every element x in S has a unique inverse y in S in the sense that x = xyx and y = yxy. Inverse semigroups appear in a range of contexts; for example, they can be employed in the… … Wikipedia
Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Join and meet — In mathematics, join and meet are dual binary operations on the elements of a partially ordered set. A join on a set is defined as the (necessarily unique) supremum (least upper bound) with respect to a partial order on the set, provided a… … Wikipedia
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
Meet (mathematics) — In mathematics, a meet on a set is defined either as the unique infimum (greatest lower bound) with respect to a partial order on the set, provided an infimum exists, or (abstractly) as a commutative and associative binary operation satisfying an … Wikipedia
Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia
Power domains — In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations.The idea of power domains for functions is that a nondeterministic function may be described as a deterministic set valued… … Wikipedia
Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… … Wikipedia
List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… … Wikipedia