Question

Injection from cardinal $\lambda$ to cardinal $\kappa$ implies $\lambda\leq\kappa$

score 113 · Answer 1 · 2026-04-15 15:55:03

113

Views

Injection from cardinal $\lambda$ to cardinal $\kappa$ implies $\lambda\leq\kappa$

Published on 15 Apr 2026 - 15:55

score 75 · Answer 2 · 2026-04-17 14:55:26

75

Views

Suppose that $X$ is a set of ordinals. Then there exists an ordinal $\beta\notin X$

Published on 17 Apr 2026 - 14:55

score 353 · Answer 3 · 2026-04-14 14:25:46

353

Views

Every well-ordered set is isomorphic to a unique ordinal number

Published on 14 Apr 2026 - 14:25

score 62 · Answer 4 · 2026-04-08 18:03:09

62

Views

A proof of Transfinite Induction

Published on 08 Apr 2026 - 18:03

score 118 · Answer 5 · 2026-04-11 16:56:51

118

Views

A Lemma in Transfinite Recursion Theorem

Published on 11 Apr 2026 - 16:56

score 1.3k · Answer 6 · 2026-05-10 12:51:55

1.3k

Views

A Proof of Transfinite Recursion Theorem

Published on 10 May 2026 - 12:51

score 101 · Answer 7 · 2026-05-10 14:05:30

101

Views

A bootstrap from the traditional version of Transfinite Recursion to the parametric one

Published on 10 May 2026 - 14:05

score 134 · Answer 8 · 2026-04-23 23:14:36

134

Views

Does this ordinal (built by using ZFC + ordinal many large cardinals to attain yet larger ordinals) have a name?

Published on 23 Apr 2026 - 23:14

score 232 · Answer 9 · 2026-05-10 12:52:52

232

Views

How do the authors deduce this weaker version of Transfinite Recursion?

Published on 10 May 2026 - 12:52

score 248 · Answer 10 · 2026-04-16 07:26:23

248

Views

Proper class if and only if there is a bijection with the class of ordinals.

Published on 16 Apr 2026 - 7:26

score 245 · Answer 11 · 2026-05-10 14:03:42

245

Views

Is this theorem equivalent to Transfinite Recursion Theorem?

Published on 10 May 2026 - 14:03

score 153 · Answer 12 · 2026-05-10 14:03:52

153

Views

Are these two statements regarding Transfinite Recursion equivalent?

Published on 10 May 2026 - 14:03

score 182 · Answer 13 · 2026-05-10 14:05:05

182

Views

Are these two parametric versions of Transfinite Recursion equivalent?

Published on 10 May 2026 - 14:05

score 127 · Answer 14 · 2026-05-10 14:06:15

127

Views

How do Hrbacek and Jech derive the class function $F$ in Theorem 4.12 from Theorem 4.11?

Published on 10 May 2026 - 14:06

score 122 · Answer 15 · 2026-04-17 09:29:27

122

Views

Is $(ω^ω)^ω$ equal to $ω^{(ω^2)}$?

Published on 17 Apr 2026 - 9:29

List Question

Injection from cardinal $\lambda$ to cardinal $\kappa$ implies $\lambda\leq\kappa$

Suppose that $X$ is a set of ordinals. Then there exists an ordinal $\beta\notin X$

Every well-ordered set is isomorphic to a unique ordinal number

A proof of Transfinite Induction

A Lemma in Transfinite Recursion Theorem

A Proof of Transfinite Recursion Theorem

A bootstrap from the traditional version of Transfinite Recursion to the parametric one

Does this ordinal (built by using ZFC + ordinal many large cardinals to attain yet larger ordinals) have a name?

How do the authors deduce this weaker version of Transfinite Recursion?

Proper class if and only if there is a bijection with the class of ordinals.

Is this theorem equivalent to Transfinite Recursion Theorem?

Are these two statements regarding Transfinite Recursion equivalent?

Are these two parametric versions of Transfinite Recursion equivalent?

How do Hrbacek and Jech derive the class function $F$ in Theorem 4.12 from Theorem 4.11?

Is $(ω^ω)^ω$ equal to $ω^{(ω^2)}$?

Trending Questions

Popular # Hahtags

Popular Questions