- regular poset
- мат. регулярное частично упорядоченное множество
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Regular polytope — In mathematics, a regular polytope is a polytope whose symmetry is transitive on its flags, thus giving it the highest degree of symmetry. All its elements or j faces (for all 0≤ j ≤ n , where n is the dimension of the polytope) cells, faces and… … Wikipedia
Regular category — In category theory, a regular category is a category with finite limits and coequalizers of kernel pairs, satisfying certain exactness conditions. In that way, regular categories recapture many properties of abelian categories, like the existence … 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
Boolean-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… … Wikipedia
Dual polyhedron — The dual of a cube is an octahedron, shown here with vertices at the cube face centers … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … 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
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
Complete Boolean algebra — This article is about a type of mathematical structure. For complete sets of Boolean operators, see Functional completeness. In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound) … Wikipedia
Polyhedron — Polyhedra redirects here. For the relational database system, see Polyhedra DBMS. For the game magazine, see Polyhedron (magazine). For the scientific journal, see Polyhedron (journal). Some Polyhedra Dodecahedron (Regular polyhedron) … Wikipedia
Polygon — For other uses, see Polygon (disambiguation). Some polygons of different kinds In geometry a polygon ( … Wikipedia