formally complete

formally complete
мат. формально полный

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем сделать НИР

Смотреть что такое "formally complete" в других словарях:

  • Complete market — In economics, a complete market (or complete system of markets) is one in which the complete set of possible gambles on future states of the world can be constructed with existing assets without friction. Every agent is able to exchange every… …   Wikipedia

  • Complete (complexity) — In computational complexity theory, a computational problem is complete for a complexity class if it is, in a formal sense, one of the hardest or most expressive problems in the complexity class. If a problem has the property that it allows you… …   Wikipedia

  • Complete homogeneous symmetric polynomial — In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression… …   Wikipedia

  • Complete Heyting algebra — In mathematics, especially in order theory, a complete Heyting algebra is a Heyting algebra which is complete as a lattice. Complete Heyting algebras are the objects of three different categories; the category CHey, the category Loc of locales,… …   Wikipedia

  • Complete measure — In mathematics, a complete measure (or, more precisely, a complete measure space) is a measure space in which every subset of every null set is measurable (having measure zero). More formally, (X, Σ, μ) is complete if and only if… …   Wikipedia

  • AI-complete — In the field of artificial intelligence, the most difficult problems are informally known as AI complete or AI hard, implying that the difficulty of these computational problems is equivalent to solving the central artificial intelligence problem …   Wikipedia

  • P-complete — In complexity theory, the notion of P complete decision problems is useful in the analysis of both: which problems are difficult to parallelize effectively, and; which problems are difficult to solve in limited space. Formally, a decision problem …   Wikipedia

  • List of minerals (complete) — It is currently not possible to have a complete list of minerals . The International Mineralogical Association (IMA) is the international group that recognises new minerals and new mineral names. However, minerals discovered before 1959 did not… …   Wikipedia

  • List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… …   Wikipedia

  • Model complete theory — In model theory, a first order theory is called model complete if every embedding of models is an elementary embedding. Equivalently, every first order formula is equivalent to a universal formula. This notion was introduced by Abraham Robinson.… …   Wikipedia

  • Bounded complete poset — In the mathematical field of order theory, a partially ordered set is bounded complete if all of its subsets which have some upper bound also have a least upper bound. Such a partial order can also be called consistently complete, since any upper …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»