### Recent Writing

- The exact strength of the class forcing theorem
- A model of the generic Vopěnka principle in which the ordinals are not $\Delta_2$-Mahlo
- A model of second-order arithmetic with the choice scheme in which $\Pi^1_2$-dependent choice fails
- Computable processes which produce any desired output in the right nonstandard model
- Virtual large cardinals

### Mathoverflow Activity

- Comment by Victoria Gitman on Does Con(ZF + Reinhardt) really imply Con(ZFC + I0)?@Stefan For some reason, I cannot click on the link.Victoria Gitman
- Comment by Victoria Gitman on Cofinality of $j(\kappa)$ for a measurability embedding $j:V\to M$ with critical point $\kappa$@AsafKaragila I edited the question to make it clearer. Maybe I will ask your version as a follow-up if you don't ask it first :).Victoria Gitman
- Comment by Victoria Gitman on Cofinality of $j(\kappa)$ for a measurability embedding $j:V\to M$ with critical point $\kappa$@AsafKaragila I should have done a better job stating my question clearly. I wanted to know precisely what Yair answered: whether there are models where $\text{cf}(j(\kappa))$ is smaller than the size of $j(\kappa)$. Your interpretation of the question is very interesting as well, but I think much harder to answer.Victoria Gitman

- Comment by Victoria Gitman on Does Con(ZF + Reinhardt) really imply Con(ZFC + I0)?
### Cantor’s Attic

- StableAdded stable ordinals. New page==$f$-Stable Ordinals== An ordinal $\alpha$ is $f$''-stable'' for a function $f$ such that $\alpha\leq f(\alpha)$ iff $L_{\alpha}\preceq_{1}L_{f(\alpha)}$. For example: The smallest $\Pi_{0}^1$-Reflective ordinal is (+1)-stable. ==$\beta$-Stable Ordinals== An ordinal $\alpha$ is $\beta$''-stable'' for an ordinal $\beta$ such that $\alpha\leq\beta$ iff $L_{\alpha}\preceq_{1}L_{\beta}$. An ordinal $\alpha$ is ''stable'' iff $L_{\alpha}\preceq_{1}L_{\omega_{1}}$. The smallest stable […]Zetapology
- User talk:Ordnials← Older revision Revision as of 02:16, 24 August 2017 Line 1: Line 1: Hi! Zetapology speaking. I would love it if we could come into contact in order to get this website back on the rails. Hi! Zetapology speaking. I would love it if we could come into contact in order to get this website […]Zetapology
- User talk:OrdnialsCreated page with "Hi! Zetapology speaking. I would love it if we could come into contact in order to get this website back on the rails." New pageHi! Zetapology speaking. I would love it if we could come into contact in order to get this website back on the rails.Zetapology
- User:ZetapologyCreated page with "Hi! I'm 14, and I love set theory and model theory. I can't yet understand all cardinal concepts, but I at least understand indescribable cardinals, reflective cardinals, and..." New pageHi! I'm 14, and I love set theory and model theory. I can't yet understand all cardinal concepts, but I at least understand […]Zetapology
- IndescribableMostly finished the page. ← Older revision Revision as of 18:12, 23 August 2017 (One intermediate revision by the same user not shown)Line 1: Line 1: {{DISPLAYTITLE:Indescribable cardinal}} {{DISPLAYTITLE:Indescribable cardinal}} +A cardinal $\kappa$ is ''indescribable'' if it holds the reflection theorem up to a certain point. This is important to mathematics because of the concern for […]Zetapology

- Stable

# 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.