- maximal antichain
- мат. максимальная антицепь
Большой англо-русский и русско-английский словарь. 2001.
maximal antichain
Смотреть что такое "maximal antichain" в других словарях:
Antichain — In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two elements in the subset are incomparable. (Some authors use the term antichain to mean strong antichain, a subset such that there is … 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
Dedekind–MacNeille completion — The Hasse diagram of a partially ordered set (left) and its Dedekind–MacNeille completion (right). In order theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal… … Wikipedia
Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … 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
Dedekind number — … Wikipedia
Driss Abouabdillah — ( ar. ادريس أبو عبدالله) (or Driss Bouabdillah) is a Moroccan mathematician born in Meknès on April 1, 1948. He is a former teacher of mathematics at the ENS (higher teacher training school) of Rabat. Contributions *In geometry, he gave several… … Wikipedia
Lubell-Yamamoto-Meshalkin inequality — In combinatorial mathematics, the Lubell Yamamoto Meshalkin inequality, more commonly known as the LYM inequality, is an inequality on the sizes of sets in a Sperner family, proved by harvtxt|Bollobás|1965, harvtxt|Lubell|1966,… … Wikipedia
Abouabdillah's theorem — refers to two distinct theorems in mathematics: one in geometry and one in number theory.GeometryIn geometry, similarities of an Euclidean space preserve circles and spheres. Conversely, Abouabdillah s theorem states that every injective or… … Wikipedia
Stable model semantics — The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program… … Wikipedia
