### Recent Writing

### Mathoverflow Activity

- Comment by Victoria Gitman on continuity points of elementary embeddings from $0^\sharp$Great! Thanks very much for the explanation!Victoria Gitman
- Comment by Victoria Gitman on continuity points of elementary embeddings from $0^\sharp$Almost got it. Why is $j'(\alpha_0)$ indiscernible?Victoria Gitman
- Comment by Victoria Gitman on continuity points of elementary embeddings from $0^\sharp$I don't see why $j$ has to be an ultrapower embedding. Is this obvious?Victoria Gitman

- Comment by Victoria Gitman on continuity points of elementary embeddings from $0^\sharp$
### Cantor’s Attic

- Feferman-Schütte← Older revision Revision as of 08:49, 22 May 2018 (2 intermediate revisions by the same user not shown)Line 27: Line 27: (For $\alpha \lt \beta$, the fixed point sets of $\varphi_\alpha$ are all closed sets, and so their intersection is closed; it is unbounded because $\cup_\alpha \varphi_\alpha(t+1)$ is a common fixed point greater than […]Denis Maksudov
- User:UbersketchCreated page with "Ubersketch - Arithmologist. Hello there." New pageUbersketch - Arithmologist. Hello there.Ubersketch
- Fast-growing hierarchy← Older revision Revision as of 14:31, 20 May 2018 Line 139: Line 139: \(f_{\varepsilon_0}(n-1) ≤ H_{\varepsilon_0}(n) ≤ f_{\varepsilon_0}(n+1)\) for all \(n ≥ 1\). \(f_{\varepsilon_0}(n-1) ≤ H_{\varepsilon_0}(n) ≤ f_{\varepsilon_0}(n+1)\) for all \(n ≥ 1\). −The [[slow-growing hierarchy]] "catches up" to the fast-growing hierarchy only at \(\psi_0(\Omega_\omega)\), using [[Buchholz's ψ functions]].+The [[slow-growing hierarchy]] "catches up" to […]Denis Maksudov
- Slow-growing hierarchy← Older revision Revision as of 14:29, 20 May 2018 Line 16: Line 16: −If \(\alpha=\varepsilon_0\) then \(\alpha[0]=0\) and \(\alpha[n+1]=\omega^{\alpha[n]}\).+If \(\alpha=\varepsilon_0\) then \(\alpha[0]=1\) and \(\alpha[n+1]=\omega^{\alpha[n]}\). Using this system of fundamental sequences we can define the slow-growing hierarchy up to \(\varepsilon_0\) and we have \(g_{\varepsilon_0}(n) = n \uparrow\uparrow n \) Using this system of […]Denis Maksudov
- Hardy hierarchy← Older revision Revision as of 10:51, 20 May 2018 Line 28: Line 28: There are much stronger systems of fundamental sequences you can see on the following pages: There are much stronger systems of fundamental sequences you can see on the following pages: − +*[http://googology.wikia.com/wiki/List_of_systems_of_fundamental_sequences List of systems of fundamental sequences] *[[Madore's ψ function]] *[[Madore's ψ […]Denis Maksudov

- Feferman-Schütte

# Category Archives: research

## The oddities of class forcing

I recently finished reading a series of excellent articles by Peter Holy, Regula Krapf, Philipp Lücke, Ana Njegomir and Philipp Schlicht investigating properties of class forcing over models of ${\rm GBC}$ (Gödel-Bernays set theory). So I would like to summarize … Continue reading

## Computable processes can produce arbitrary outputs in nonstandard models (continued)

In the previous post, I discussed a theorem of Woodin, extended recently by Blanck and Enayat, showing that for every computably enumerable theory $T$, there is in index $e$ such that if $M\models T$ satisfies that $W_e$ is contained in … Continue reading

## Set Theory Day to celebrate Joel David Hamkins’ 50th birthday

My former PhD supervisor, collaborator, and dear friend Joel David Hamkins is turning 50 this year. Evidently, Joel is much too young for a full-blown birthday conference, but some celebration must still be had. So to celebrate Joel’s birthday, we … Continue reading

## My first Black Board Day

Last Saturday, I participated in my first Black Board Day, an informal annual workshop dedicated to Gödel and organized for the past ten years by the neuroscientist Memming Park and his enthusiastic group of scientist friends.

## Separating the choice scheme from the parameter-free choice scheme in second-order arithmetic

This post is motivated by a really great paper of Wojciech Guzicki from the 1970s entitled “On weaker forms of choice in second-order arithmetic” [1] that I recently stumbled on while trying to trace the history of choice principles in … Continue reading

## Co-organizing the CUNY Set Theory Seminar

I was lucky enough to start graduate school and end up choosing the same adviser with two people who still remain my favorite colleagues and dearest friends. Coincidentally, the adviser also turned out to be quite good. The students were … Continue reading

Posted in personal, research
Tagged CUNY Set Theory Seminar, J. D. Hamkins, J. Reitz, T. Johnstone
4 Comments

## An absoluteness lemma for countable embeddings

If $W$ is a transitive set or class and it thinks that there is an elementary embedding $j$ between some first-order structures $\mathcal M$ and $\mathcal N$, then $j$ is an actual elementary embedding and so the universe $V$ agrees … Continue reading

## Variants of Kelley-Morse set theory

Joel Hamkins recently wrote an excellent post on Kelley-Morse set theory (${\rm KM}$) right here on Boolesrings. I commented on the post about the variations one finds of what precisely is included in the ${\rm KM}$ axioms. I claimed that … Continue reading

## Forcing to add proper classes to a model of ${\rm GBC}$: The technicalities

In the previous post Forcing to add proper classes to a model of ${\rm GBC}$: An introduction, I made several sweeping assertions that will now be held up to public scrutiny.

## Forcing to add proper classes to a model of ${\rm GBC}$: An introduction

If you are interested in a mathematical universe whose ontology includes both sets and classes, you might consider for its foundation the ${\rm GBC}$ (Gödel-Bernays) axioms.