新鲜
发表于 2025-3-25 06:37:31
Introduction,ation . ↦ . which assigns to every ordinal . < . a set . of smaller ordinals that is closed and unbounded in the set of ordinals < .. The transfinite sequence . which we call a ‘.-sequence’ and on which we base our recursive constructions may have a number of ‘coherence properties’ and we shall give
forthy
发表于 2025-3-25 10:36:09
http://reply.papertrans.cn/103/10204/1020356/1020356_22.png
excursion
发表于 2025-3-25 12:20:32
Walks on Countable Ordinals,al essence can be reformulated as problems about ., which is in some sense the smallest uncountable structure. What we mean by ‘structure’ is . together with a system . (. < .) of fundamental sequences, i.e., a system with the following two properties:
convulsion
发表于 2025-3-25 19:41:12
http://reply.papertrans.cn/103/10204/1020356/1020356_24.png
Affiliation
发表于 2025-3-25 20:18:27
http://reply.papertrans.cn/103/10204/1020356/1020356_25.png
GONG
发表于 2025-3-26 02:28:19
The Square-bracket Operation on Countable Ordinals,(..) for all . < .. Recall also the notion of the . of the minimal walk, . the finite set of places visited in the minimal walk from . to .. The following simple fact about the upper trace lies at the heart of all known definitions of square-bracket operations, not only on . but also at higher car
inhumane
发表于 2025-3-26 06:19:09
General Walks and Their Characteristics, level of the tree. The fundamental importance of this question has already been realized in the work of Kurepa and then later in the works of Erdős and Tarski in their respective attempts to develop the theory of partition calculus and large cardinals. A tree . of height equal to some reg
somnambulism
发表于 2025-3-26 12:18:50
General Walks and Their Characteristics, level of the tree. The fundamental importance of this question has already been realized in the work of Kurepa and then later in the works of Erdős and Tarski in their respective attempts to develop the theory of partition calculus and large cardinals. A tree . of height equal to some reg
Anthology
发表于 2025-3-26 15:17:06
The Oscillation Mapping and the Square-bracket Operation,ting . ∼ . iff the closed interval determined by . and . contains no point from .. Hence, osc(.) is simply the number of convex pieces the set .(sup(. ⋂ .)+1) is split by the set . (see Figure 8.1). Note that this is slightly different from the way we have defined the oscillation between two subse
取之不竭
发表于 2025-3-26 17:09:11
http://reply.papertrans.cn/103/10204/1020356/1020356_30.png