Skip to main content

All Questions

0 votes
1 answer
51 views

Is $\operatorname{rank}(A)\subseteq\operatorname{TC}(A)$?

This question came to me when I was thinking about rank and transitive closures. Let $A$ be a set of rank $\alpha$ and let $\operatorname{TC}(A)$ denote the transitive closure of $A$. Is it true then ...
Anon's user avatar
  • 448
4 votes
1 answer
182 views

Colourful class function

Background. We're in $\mathsf{ZFC}$, and I can use the principle of $\epsilon$-induction, but not (directly) the $\epsilon$-recursion. Problem. Let $F : V \to V$, where $V$ is the class of all the ...
lelouch_l8r4's user avatar
1 vote
2 answers
104 views

Transfinite recursion to construct a function on ordinals

I am asked to use transfinite recursion to show that there is a function $F:ON \to V$ (here $ON$ denote the class of ordinals and $V$ the class of sets) that satisfies: $F(0) = 0$ $F(\lambda) = \...
Guest_000's user avatar
  • 839
2 votes
1 answer
42 views

If $X_1$,$X_2$ are wosets isomorphic to ordinals $\alpha_1,\alpha_2$ then $X_1\times X_2$ is isomorphic to $\alpha_2\cdot \alpha_1$

I want to prove the following: Let $X_1$,$X_2$ be wosets, isomorphic to ordinals $\alpha_1,\alpha_2$ respectively. Then $X_1\times X_2$, with the lexicographic order, is isomorphic to $\alpha_2\cdot\...
Alphie's user avatar
  • 4,827
0 votes
1 answer
89 views

How to prove this alternative version of transfinite recursion

There are several formulations of transfinite recursion. I am interested in the following one. Let $(V, \in)$ be a model of ZF. Let $g_1$ be a set and $G_2,G_3 : V \to V$ be two definable class ...
user700974's user avatar
2 votes
1 answer
107 views

I don't understand this proof: Trichotomy for ordinals (by double transfinite induction)

Hello everyone! The proof is from this book: https://st.openlogicproject.org/ I think I understand the black bracket (checked). What worries me is the blue bracket (question mark). As far as I ...
Ettore's user avatar
  • 537
2 votes
1 answer
75 views

if $\omega^{\alpha} =A \cup B$ then $A$ or $B$ has order type $\omega^{\alpha}$

Show that if $\omega^{\alpha} =A \cup B$ then $A$ or $B$ has order type $\omega^{\alpha}$ where $\alpha \geq 1$ is a ordinal number. Hint: Use induction on $\alpha$ I don't know how to start with the ...
James R.'s user avatar
  • 133
0 votes
1 answer
62 views

Obscure question in Smullyan and Fitting: "strengthening of definition by finite recurrence"

Context: self-study from Smullyan and Fitting's "Set Theory and the Continuum Problem" (revised 2010 edition), chapter 3, section 8, Definition by Finite Recursion. They give Theorem 8.1 ...
Prime Mover's user avatar
  • 5,057
0 votes
1 answer
143 views

Transfinite Construction, an intuitive interpretation.

Theorem (Transfinite Construction). Let $W$ be a well-ordered set, and $E$ an arbitrary class. Assume: For each $x\in W$, there is a given rule $R_x$ that associates with each $\varphi\colon W(x)\to E$...
Choripán Con Pebre's user avatar
1 vote
1 answer
161 views

Questions about the induction on cardinals

From Hereditary Cardinality and Rank : For an infinite cardinal $\kappa$, $$\forall x,\ \textrm{hcard }x<\kappa\rightarrow\textrm{rank }x<\kappa$$ We can show this by induction on $\kappa$. ...
user557's user avatar
  • 12k
1 vote
1 answer
101 views

Explain why transfinite induction does not assume that a property must be true for zero.

THIS QUESTION IS NOT A DUPLICATE OF THIS ONE!!! So I would like to discuss the following proof of transfinite induction which is taken by the text Introduction to Set Theory wroten by Karell Hrbacek ...
Antonio Maria Di Mauro's user avatar
1 vote
1 answer
120 views

Exercises on transfinite induction

Define by transfinite recursion $V(0)=\emptyset, V(\alpha+1)=\mathcal P(V(\alpha)), V(\alpha)=\cup_{\beta < \alpha}V(\beta)$ for $\beta$ a limit ordinal. I'm trying to show the following properties:...
user557's user avatar
  • 12k
0 votes
0 answers
64 views

Question on the hierarchy of named Ordinals

I was wondering how many named transfinite ordinals there are, and what the notations and names are, arranged as a hierarchy which ignores the different levels on a single level of Ordinals (ω+1, 2ω, ...
Zoey's user avatar
  • 218
1 vote
1 answer
70 views

How to show that the Zermelo hierarchy is really a hierarchy?

In Cameron's Sets, Logic and Categories (p. 48-49), he sets out prove the following fact about the Zermelo hierarchy $V$, namely, that $V_\alpha\subseteq V_{s(\alpha)}$ for all ordinals $\alpha$. His ...
Doubt's user avatar
  • 1,779
1 vote
2 answers
331 views

Recursion theorem for ordinals proof

I'm trying to understand the proof of the recursion principle of ordinals, the theorem is: The proof of this theorem uses this other theorem: The proof is pretty long (I'm sorry) so I will try to ...
Andrea Burgio's user avatar

15 30 50 per page