Question

Showing $\Gamma(\alpha\times\alpha)\leq\omega^\alpha$.

score 83 · Answer 1 · 2026-04-15 19:33:38

83

Views

Showing $\Gamma(\alpha\times\alpha)\leq\omega^\alpha$.

Published on 15 Apr 2026 - 19:33

score 152 · Answer 2 · 2026-04-17 15:12:07

152

Views

Set or list compression

Published on 17 Apr 2026 - 15:12

score 204 · Answer 3 · 2026-04-09 20:56:21

204

Views

Help solving this proof using Well Ordering Principle

Published on 09 Apr 2026 - 20:56

score 124 · Answer 4 · 2026-04-12 00:37:59

124

Views

Proof by contradiction and the well ordering principle

Published on 12 Apr 2026 - 0:37

score 289 · Answer 5 · 2026-04-09 07:12:16

289

Views

Help understanding Well-Ordering Theorem

Published on 09 Apr 2026 - 7:12

score 465 · Answer 6 · 2026-04-09 16:34:48

465

Views

How strong is the axiom of well-ordered choice?

Published on 09 Apr 2026 - 16:34

score 345 · Answer 7 · 2026-04-14 15:51:08

345

Views

Why is the Axiom of Well-ordered Choice not strong enough to prove Zorn's Lemma?

Published on 14 Apr 2026 - 15:51

score 192 · Answer 8 · 2026-04-13 06:45:43

192

Views

Given $S \hookrightarrow T$ construct $U ≈ T$ disjoint from $S$ in Z set theory?

Published on 13 Apr 2026 - 6:45

score 306 · Answer 9 · 2026-05-10 20:53:51

306

Views

Intuition behind Well Ordering Principle and Axiom of Choice

Published on 10 May 2026 - 20:53

score 539 · Answer 10 · 2026-04-16 03:37:42

539

Views

Indexing of uncountable sets and uncountable collections of sets, uncountable intersections containing a point

Published on 16 Apr 2026 - 3:37

score 726 · Answer 11 · 2026-04-15 11:52:43

726

Views

Directed set and partially/totally ordered sets.

Published on 15 Apr 2026 - 11:52

score 194 · Answer 12 · 2026-04-13 21:06:12

194

Views

Zermelo's Proof of the Well Ordering Theorem

Published on 13 Apr 2026 - 21:06

score 74 · Answer 13 · 2026-04-16 07:35:20

74

Views

Prove that for every natural number $a$ there are integers $t \geq 0$ and $r$ such that $a = 3^t r$ and 3 does not divide r.

Published on 16 Apr 2026 - 7:35

score 53 · Answer 14 · 2026-04-12 17:44:44

53

Views

Provable well-founded ordering

Published on 12 Apr 2026 - 17:44

score 50 · Answer 15 · 2026-04-14 22:00:30

50

Views

Let $≤$ be a total order on $A$. For each $u\in A$, let $s(u)=\{x\in A:x<u\}$...Prove that $≤$ is a well-ordering on $A$.

Published on 14 Apr 2026 - 22:00

List Question

Showing $\Gamma(\alpha\times\alpha)\leq\omega^\alpha$.

Set or list compression

Help solving this proof using Well Ordering Principle

Proof by contradiction and the well ordering principle

Help understanding Well-Ordering Theorem

How strong is the axiom of well-ordered choice?

Why is the Axiom of Well-ordered Choice not strong enough to prove Zorn's Lemma?

Given $S \hookrightarrow T$ construct $U ≈ T$ disjoint from $S$ in Z set theory?

Intuition behind Well Ordering Principle and Axiom of Choice

Indexing of uncountable sets and uncountable collections of sets, uncountable intersections containing a point

Directed set and partially/totally ordered sets.

Zermelo's Proof of the Well Ordering Theorem

Prove that for every natural number $a$ there are integers $t \geq 0$ and $r$ such that $a = 3^t r$ and 3 does not divide r.

Provable well-founded ordering

Let $≤$ be a total order on $A$. For each $u\in A$, let $s(u)=\{x\in A:x<u\}$...Prove that $≤$ is a well-ordering on $A$.

Trending Questions

Popular # Hahtags

Popular Questions