- well-ordering principle
- мат. принцип вполне упорядочения
Большой англо-русский и русско-английский словарь. 2001.
well-ordering principle
Смотреть что такое "well-ordering principle" в других словарях:
Well-ordering principle — In mathematics, the well ordering principle states that every non empty set of positive integers contains a smallest element. [cite book |title=Introduction to Analytic Number Theory |last=Apostol |first=Tom |authorlink=Tom M. Apostol |year=1976… … Wikipedia
Well-ordering theorem — The well ordering theorem (not to be confused with the well ordering axiom) states that every set can be well ordered.This is important because it makes every set susceptible to the powerful technique of transfinite induction.Georg Cantor… … Wikipedia
Well-founded relation — In mathematics, a binary relation, R, is well founded (or wellfounded) on a class X if and only if every non empty subset of X has a minimal element with respect to R; that is, for every non empty subset S of X, there is an element m of S such… … Wikipedia
Transfer principle — In mathematics, the transfer principle is a concept in Abraham Robinson s non standard analysis of the hyperreal numbers. It states that any sentence expressible in a certain formal language that is true of real numbers is also true of hyperreal… … Wikipedia
Commitment ordering — In concurrency control of databases, transaction processing (transaction management), and related applications, Commitment ordering (or Commit ordering; CO; (Raz 1990, 1992, 1994, 2009)) is a class of interoperable Serializability techniques … 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
Structural induction — is a proof method that is used in mathematical logic (e.g., the proof of Łoś theorem), computer science, graph theory, and some other mathematical fields. It is a generalization of mathematical induction. Structural recursion is a recursion… … Wikipedia
List of mathematics articles (W) — NOTOC Wad Wadge hierarchy Wagstaff prime Wald test Wald Wolfowitz runs test Wald s equation Waldhausen category Wall Sun Sun prime Wallenius noncentral hypergeometric distribution Wallis product Wallman compactification Wallpaper group Walrasian… … Wikipedia
axiom of choice — Math. the axiom of set theory that given any collection of disjoint sets, a set can be so constructed that it contains one element from each of the given sets. Also called Zermelo s axiom; esp. Brit., multiplicative axiom. * * * ▪ set theory… … Universalium
Zorn's lemma — /zawrnz/, Math. a theorem of set theory that if every totally ordered subset of a nonempty partially ordered set has an upper bound, then there is an element in the set such that the set contains no element greater than the specified given… … Universalium
Berry paradox — The Berry paradox is a self referential paradox arising from the expression the smallest possible integer not definable by a given number of words. Bertrand Russell, the first to discuss the paradox in print, attributed it to G. G. Berry, a… … Wikipedia
