- well-founded ordering
- мат. фундированное упорядочение
Большой англо-русский и русско-английский словарь. 2001.
well-founded ordering
Смотреть что такое "well-founded ordering" в других словарях:
Well-quasi-ordering — In mathematics, specifically order theory, a well quasi ordering or wqo is a well founded quasi ordering with an additional restriction on sequences that there is no infinite sequence x i with x i ot le x j for all i < j . Motivation We can use… … 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
Well-order — In mathematics, a well order relation (or well ordering) on a set S is a total order on S with the property that every non empty subset of S has a least element in this ordering.Equivalently, a well ordering is a well founded total order.The set… … Wikipedia
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
MUSIC — This article is arranged according to the following outline: introduction written sources of direct and circumstantial evidence the material relics and iconography notated sources oral tradition archives and important collections of jewish music… … Encyclopedia of Judaism
BIBLE — THE CANON, TEXT, AND EDITIONS canon general titles the canon the significance of the canon the process of canonization contents and titles of the books the tripartite canon … Encyclopedia of Judaism
Implementation of mathematics in set theory — This article examines the implementation of mathematical concepts in set theory. The implementation of a number of basic mathematical concepts is carried out in parallel in ZFC (the dominant set theory) and in NFU, the version of Quine s New… … 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
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
New Foundations — In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled New Foundations for … Wikipedia
Radovan Karadžić — For other people of the same name, see Karadžić. Radovan Karadžić Радован Караџић Radovan Karadžić in Moscow on 3 March 1994 1st President of Republika Srpska … Wikipedia
