- normal poset
- мат. нормальное частично упорядоченное множество
Большой англо-русский и русско-английский словарь. 2001.
normal poset
Смотреть что такое "normal poset" в других словарях:
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
List of forcing notions — In mathematics, forcing is a method of constructing new models M[G] of set theory by adding a generic subset G of a poset P to a model M. The poset P used will determine what statements hold in the new universe (the extension ); to force a… … Wikipedia
Antimatroid — In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids … Wikipedia
Nim — For other uses, see Nim (disambiguation). Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects… … Wikipedia
Compact element — In the mathematical area of order theory, the compact or finite elements of a partially ordered set are those elements that cannot be subsumed by a supremum of any non empty directed set that does not already contain members above the compact… … Wikipedia
Nilpotent orbit — Nilpotent orbits are generalizations of nilpotent matrices that play an important role in representation theory of real and complex semisimple Lie groups and semisimple Lie algebras. Contents 1 Definition 2 Examples 3 Properties … 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
Incidence algebra — In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for any locally finite partially ordered set and commutative ring with unity. Contents 1 Definition 1.1 Related concepts 2 Special elements … Wikipedia
Abstract polytope — In mathematics, an abstract polytope is a combinatorial structure with properties similar to those shared by a more classical polytope. Abstract polytopes correspond to the structures of polygons, polyhedra, tessellations of the plane and higher… … Wikipedia
Ontology chart — The case study used here to illustrate the transformation process is a slight adaptation of the case used by Bonacin (2004).[1] An Ontology Chart is a type of chart used in Semiotics and software engineering to illustrate an ontology … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
