successor of an ordinal number α is the smallest ordinal number greater than α. An ordinal number that is a successor is called a successor ordinal....
2 KB (288 words) - 19:08, 18 July 2023
In set theory, an ordinal number, or ordinal, is a generalization of ordinal numerals (first, second, nth, etc.) aimed to extend enumeration to infinite...
48 KB (6,719 words) - 01:48, 8 September 2024
limit ordinal is an ordinal number that is neither zero nor a successor ordinal. Alternatively, an ordinal λ is a limit ordinal if there is an ordinal less...
8 KB (1,083 words) - 20:34, 11 March 2024
In the mathematical field of set theory, ordinal arithmetic describes the three usual operations on ordinal numbers: addition, multiplication, and exponentiation...
36 KB (4,957 words) - 14:24, 29 August 2024
program Successor (EP), an EP by Sonata Arctica Successor (album), an album by Dedekind Cut A successor cardinal A successor ordinal The successor function...
2 KB (218 words) - 22:30, 25 March 2024
cardinal. If λ were a successor ordinal, then ℵλ would be a successor cardinal and hence not weakly inaccessible. If λ were a limit ordinal less than κ then...
16 KB (1,960 words) - 12:52, 27 August 2024
define a successor operation on cardinal numbers in a similar way to the successor operation on the ordinal numbers. The cardinal successor coincides...
4 KB (564 words) - 06:38, 6 March 2024
Order topology (redirect from Ordinal space)
spaces, and no ordinal beyond that is discrete. The ordinal α is compact as a topological space if and only if α is either a successor ordinal or zero. The...
15 KB (2,106 words) - 09:57, 1 September 2024
the characterization of computability by recursive functions. Successor ordinal Successor cardinal Increment and decrement operators Sequence Steffen,...
3 KB (389 words) - 13:27, 27 March 2024
Natural number (redirect from Zermelo ordinals)
based on an axiomatization of the properties of ordinal numbers: each natural number has a successor and every non-zero natural number has a unique predecessor...
53 KB (5,922 words) - 19:52, 1 September 2024
Veblen function (redirect from Fundamental sequence (ordinals))
functions from ordinals to ordinals), introduced by Oswald Veblen in Veblen (1908). If φ0 is any normal function, then for any non-zero ordinal α, φα is the...
16 KB (2,756 words) - 10:56, 30 August 2024
} if λ is a successor ordinal then ℵ λ {\displaystyle \aleph _{\lambda }} is not a weak limit. Conversely, if a cardinal κ is a successor cardinal, say...
6 KB (855 words) - 21:31, 26 December 2021
Regnal number (redirect from Ordinal (monarchs))
Regnal numbers are ordinal numbers used to distinguish among persons with the same name who held the same office. Most importantly, they are used to distinguish...
28 KB (3,512 words) - 07:05, 3 May 2024
{\Bigr \}}} for any limit ordinal λ {\displaystyle \lambda } Note that this behavior is different from that of successor ordinals. Cardinalities less than...
13 KB (2,227 words) - 02:51, 19 June 2024
Cardinal number (section Successor cardinal)
finite cardinals, the successor is simply κ + 1. For infinite cardinals, the successor cardinal differs from the successor ordinal. If X and Y are disjoint...
26 KB (3,808 words) - 01:08, 27 April 2024
recursive ordinals. Since the successor of a recursive ordinal is recursive, the Church–Kleene ordinal is a limit ordinal. It is also the smallest ordinal that...
12 KB (1,815 words) - 18:59, 27 July 2024
system of ordinal notations. Briefly, an ordinal notation is either the name zero (describing the ordinal 0), or the successor of an ordinal notation (describing...
40 KB (5,516 words) - 05:55, 17 September 2024
ordinal β 1. βX is the Stone–Čech compactification of X 2. An ordinal γ A gamma number, an ordinal of the form ωα Γ The Gamma function of ordinals....
91 KB (11,519 words) - 01:11, 8 September 2024
Transfinite number (redirect from Transfinite ordinal)
used to quantify the size of infinite sets, and the transfinite ordinals, which are ordinal numbers used to provide an ordering of infinite sets. The term...
10 KB (1,230 words) - 01:37, 12 June 2024
successor of a computable ordinal is computable, and the set of all computable ordinals is closed downwards. The supremum of all computable ordinals is...
2 KB (229 words) - 22:15, 23 January 2024
Cofinality (redirect from Singular ordinal)
cofinality of any successor ordinal is 1. The cofinality of any nonzero limit ordinal is an infinite regular cardinal. A regular ordinal is an ordinal that is equal...
8 KB (1,302 words) - 14:50, 20 August 2024
Fixed-point lemma for normal functions (redirect from Ordinal fixed point theorem)
continuous: for every limit ordinal λ {\displaystyle \lambda } (i.e. λ {\displaystyle \lambda } is neither zero nor a successor), f ( λ ) = sup { f ( α )...
4 KB (650 words) - 20:31, 11 March 2024
rank strictly less than α, regardless of whether α is 0, a successor ordinal, or a limit ordinal: V α := ⋃ β < α P ( V β ) . {\displaystyle V_{\alpha }:=\bigcup...
21 KB (2,809 words) - 09:08, 28 May 2024
In mathematical logic and set theory, an ordinal notation is a partial function mapping the set of all finite sequences of symbols, themselves members...
16 KB (1,860 words) - 06:30, 23 April 2024
transitive set x is an ordinal, x is a limit ordinal, x is a successor ordinal x is a finite ordinal The first infinite ordinal ω x is an ordered pair...
10 KB (1,368 words) - 03:20, 3 August 2024
information Multiset Musical set theory Ordinal number Infinite descending chain Limit ordinal Successor ordinal Transfinite induction ∈-induction Well-founded...
9 KB (448 words) - 16:05, 3 August 2022
ordinal α. The Morley rank is at least 0 if S is non-empty. For α a successor ordinal, the Morley rank is at least α if in some elementary extension N of...
4 KB (627 words) - 21:05, 5 January 2023
Kleene's O (category Ordinal numbers)
regarded as ordinal notations. It contains ordinal notations for every computable ordinal, that is, ordinals below Church–Kleene ordinal, ω 1 CK {\displaystyle...
13 KB (2,310 words) - 20:32, 11 March 2024
Transfinite induction (category Ordinal numbers)
{\displaystyle P(0)} is true. Successor case: Prove that for any successor ordinal α + 1 {\displaystyle \alpha +1} , P ( α + 1 ) {\displaystyle P(\alpha...
8 KB (1,141 words) - 20:15, 8 October 2023
S (corresponding to the limit ordinal case) or by appending b(S) to the "last" S (corresponding to the successor ordinal case). This proof shows that actually...
31 KB (4,700 words) - 17:06, 30 August 2024