### Recent Writing

- Virtual large cardinal principles
- Filter games and Ramsey-like cardinals
- 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

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

- IndescribableAdded consistency strength notes ← Older revision Revision as of 23:08, 19 October 2017 Line 7: Line 7: In other words, if a cardinal is $\Pi_{m}^n$-indescribable, then every $n+1$-th order logic statement that is $\Pi_m$ expresses the reflection of $V_{\kappa}$ onto $V_{\alpha}$. This exercises the fact that these cardinals are so large they almost […]Zetapology
- Axiom of determinacy← Older revision Revision as of 18:26, 19 October 2017 (14 intermediate revisions by the same user not shown)Line 41: Line 41: * The reals cannot be well-ordered. Thus the full [[axiom of choice]] fails. * The reals cannot be well-ordered. Thus the full [[axiom of choice]] fails. * Every set of real is [[:wikipedia:Lebesgue measurable|Lebesgue […]Wabb2t
- ReflectingAdded small remark of $\aleph$-fixed point-ness ← Older revision Revision as of 03:56, 13 October 2017 Line 13: Line 13: * A simple Löwenheim-Skolem argument shows that every infinite cardinal $\kappa$ is $\Sigma_1$-correct. * A simple Löwenheim-Skolem argument shows that every infinite cardinal $\kappa$ is $\Sigma_1$-correct. * For each natural number $n$, the $\Sigma_n$-correct cardinals form […]Zetapology

- Indescribable

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