Skip to content
The Lumenary

Practice · Research pathways

Large cardinals

Large cardinals

Warm-upHuman

Which of these cardinals are regular? (Choose all that apply; assume ZFC.)

Choose all that apply

Large cardinals

Warm-upHuman

The cumulative hierarchy starts V0=∅V_0 = \varnothing, Vn+1=P(Vn)V_{n+1} = \mathcal P(V_n). How many elements does V4V_4 have?

Large cardinals

CoreHuman

Why is ω\omega not measurable, even though non-principal ultrafilters on ω\omega exist? (Consider countable completeness.)

Choose one

Large cardinals

CoreHuman

In the proof that Vκ⊨ZFCV_\kappa \models \mathsf{ZFC} for inaccessible κ\kappa, which axiom's verification uses the regularity of κ\kappa in an essential way?

Choose one

Large cardinals

CoreHuman

Suppose ZFC proved "there is an inaccessible cardinal". What would follow?

Choose one

Large cardinals

CoreHuman

Write IC for "there is an inaccessible cardinal". Which statements are correct? (Choose all that apply; assume ZFC + IC is consistent.)

Choose all that apply

Large cardinals

CoreFormal

Which Lean predicate correctly expresses that an ultrafilter U : Ultrafilter α is κ-complete?

Choose one

Large cardinals

StretchHuman

In the proof that a measurable κ\kappa is a strong limit, we take an injection g:κ→P(λ)g : \kappa \to \mathcal P(\lambda) with λ<κ\lambda < \kappa and sets Yi∈UY_i \in U deciding whether i∈g(α)i \in g(\alpha). Why does Y=⋂i<λYiY = \bigcap_{i < \lambda} Y_i have at most one element?

Choose one

Large cardinals

StretchHuman

In Scott's proof that a measurable cardinal implies V≠LV \ne L, we assume V=LV = L and take j:V→Mj : V \to M with critical point κ\kappa, the least measurable. Why is M=VM = V?

Choose one

Large cardinals

StretchComputational

Write laver_table(n) returning a dict rows with rows[p][q - 1] = p * q in the Laver table AnA_n on {1,…,2n}\{1, \dots, 2^n\}: row 2n2^n is 1,2,…,2n1, 2, \dots, 2^n, and for p<2np < 2^n fill the rows from p=2n−1p = 2^n - 1 down to 11 using p∗1=p+1p * 1 = p + 1 and p∗(q+1)=(p∗q)∗(p+1)p * (q + 1) = (p * q) * (p + 1). Then write period(row) returning the least period of a list.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.