transfinitely

См. также в других словарях:

• Russell's paradox — Part of the foundations of mathematics, Russell s paradox (also known as Russell s antinomy), discovered by Bertrand Russell in 1901, showed that the naive set theory of Frege leads to a contradiction.It might be assumed that, for any formal… …   Wikipedia

• Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… …   Wikipedia

• Large cardinal property — In the mathematical field of set theory, a large cardinal property is a certain kind of property of transfinite cardinal numbers. Cardinals with such properties are, as the name suggests, generally very large (for example, bigger than aleph zero …   Wikipedia

• Infinity-Borel set — In set theory, a subset of a Polish space X is infin; Borel if itcan be obtained by starting with the open subsets of X, and transfinitely iterating the operations of complementation and wellordered union (but see the caveat below). Formal… …   Wikipedia

• Determinacy — Determined redirects here. For the 2005 heavy metal song, see Determined (song). For other uses, see Indeterminacy (disambiguation). In set theory, a branch of mathematics, determinacy is the study of under what circumstances one or the other… …   Wikipedia

• Large countable ordinal — In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of… …   Wikipedia

• Ordinal collapsing function — In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger …   Wikipedia

• 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