-
1 algebra with minimality condition
Универсальный англо-русский словарь > algebra with minimality condition
-
2 algebra
algebra with minimality condition — алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей
algebra with maximality condition — алгебра с условием максимальности, алгебра с условием обрыва возрастающих цепей
-
3 minimality
минимальность algebra with minimality condition ≈ алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей - minimality conditionБольшой англо-русский и русско-английский словарь > minimality
-
4 minimality
algebra with minimality condition — алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей
См. также в других словарях:
Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… … Wikipedia
Sz.-Nagy's dilation theorem — The Sz. Nagy dilation theorem (proved by Béla Szőkefalvi Nagy) states that every contraction T on a Hilbert space H has a unitary dilation U to a Hilbert space K , containing H , with:T^n = P H U^n vert HMoreover, such a dilation is unique (up to … Wikipedia
Differential form — In the mathematical fields of differential geometry and tensor calculus, differential forms are an approach to multivariable calculus that is independent of coordinates. Differential forms provide a better[further explanation needed] definition… … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number 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
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … 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
Duality (mathematics) — In mathematics, a duality, generally speaking, translates concepts, theorems or mathematical structures into other concepts, theorems or structures, in a one to one fashion, often (but not always) by means of an involution operation: if the dual… … Wikipedia
o-minimal theory — In mathematical logic, and more specifically in model theory, an infinite structure (M,<,...) which is totally ordered by < is called an o minimal structure if and only if every definable subset X ⊂ M (with parameters taken from… … Wikipedia