Question

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

score 110 · Answer 1 · 2018-10-14 23:33:03

110

Views

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

Published on 14 Oct 2018 - 23:33

score 72 · Answer 2 · 2018-10-15 01:38:20

72

Views

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

Published on 15 Oct 2018 - 1:38

score 350 · Answer 3 · 2018-10-15 05:36:09

350

Views

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

Published on 15 Oct 2018 - 5:36

score 59 · Answer 4 · 2018-10-15 15:05:50

59

Views

A proof of Transfinite Induction

Published on 15 Oct 2018 - 15:05

score 115 · Answer 5 · 2018-10-16 16:33:02

115

Views

A Lemma in Transfinite Recursion Theorem

Published on 16 Oct 2018 - 16:33

score 1.3k · Answer 6 · 2026-03-25 04:37:42

1.3k

Views

A Proof of Transfinite Recursion Theorem

Published on 25 Mar 2026 - 4:37

score 93 · Answer 7 · 2026-03-25 06:02:10

93

Views

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

Published on 25 Mar 2026 - 6:02

score 129 · Answer 8 · 2026-03-17 16:29:10

129

Views

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

Published on 17 Mar 2026 - 16:29

score 226 · Answer 9 · 2026-03-25 04:36:23

226

Views

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

Published on 25 Mar 2026 - 4:36

score 245 · Answer 10 · 2018-10-21 10:16:14

245

Views

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

Published on 21 Oct 2018 - 10:16

score 243 · Answer 11 · 2026-03-25 06:18:54

243

Views

Is this theorem equivalent to Transfinite Recursion Theorem?

Published on 25 Mar 2026 - 6:18

score 150 · Answer 12 · 2026-03-25 06:18:58

150

Views

Are these two statements regarding Transfinite Recursion equivalent?

Published on 25 Mar 2026 - 6:18

score 179 · Answer 13 · 2026-03-25 06:24:27

179

Views

Are these two parametric versions of Transfinite Recursion equivalent?

Published on 25 Mar 2026 - 6:24

score 124 · Answer 14 · 2026-03-25 06:19:49

124

Views

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

Published on 25 Mar 2026 - 6:19

score 119 · Answer 15 · 2018-10-28 06:27:54

119

Views

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

Published on 28 Oct 2018 - 6:27

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