| Publication | Date of Publication | Type |
|---|
| Infinite Wordle and the mastermind numbers | 2024-01-02 | Paper |
| Choiceless large cardinals and set‐theoretic potentialism | 2023-09-12 | Paper |
| Transfinite game values in infinite draughts | 2022-12-14 | Paper |
| Pseudo-countable models | 2022-10-10 | Paper |
| Fregean abstraction in Zermelo-Fraenkel set theory: a deflationary account | 2022-09-16 | Paper |
| Nonlinearity and illfoundedness in the hierarchy of large cardinal consistency strength | 2022-08-15 | Paper |
| THE Σ1-DEFINABLE UNIVERSAL FINITE SEQUENCE | 2022-06-15 | Paper |
| Reflection in second-order set theory with abundant urelements bi-interprets a supercompact cardinal | 2022-04-20 | Paper |
| THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES | 2022-03-18 | Paper |
| Topological models of arithmetic | 2022-02-11 | Paper |
| Infinite Hex is a draw | 2022-01-17 | Paper |
| Kelley–Morse set theory does not prove the class Fodor principle | 2021-11-03 | Paper |
| BI-INTERPRETATION IN WEAK SET THEORIES | 2021-10-27 | Paper |
| Is the twin prime conjecture independent of Peano Arithmetic? | 2021-10-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5857677 | 2021-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5856638 | 2021-03-29 | Paper |
| THE EXACT STRENGTH OF THE CLASS FORCING THEOREM | 2021-03-19 | Paper |
| Modal model theory | 2020-09-20 | Paper |
| Categorical large cardinals and the tension between categoricity and set-theoretic reflection | 2020-09-15 | Paper |
| Forcing as a computational process | 2020-07-01 | Paper |
| Inner-model reflection principles | 2020-06-09 | Paper |
| Representing Ordinal Numbers with Arithmetically Interesting Sets of Real Numbers | 2020-05-12 | Paper |
| When does every definable nonempty set have a definable element? | 2020-05-06 | Paper |
| Incomparable ω1‐like models of set theory | 2020-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5107104 | 2020-04-23 | Paper |
| Bi-interpretation in weak set theories | 2020-01-15 | Paper |
| THE IMPLICITLY CONSTRUCTIBLE UNIVERSE | 2020-01-10 | Paper |
| The rearrangement number | 2019-12-18 | Paper |
| The Sigma_1-definable universal finite sequence | 2019-09-19 | Paper |
| Set-theoretic blockchains | 2019-09-19 | Paper |
| The subseries number | 2019-07-31 | Paper |
| Kelley-Morse set theory does not prove the class Fodor principle | 2019-04-08 | Paper |
| A model of the generic Vopěnka principle in which the ordinals are not Mahlo | 2019-01-24 | Paper |
| Ehrenfeucht's lemma in set theory | 2018-09-19 | Paper |
| Open class determinacy is preserved by forcing | 2018-06-28 | Paper |
| ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES | 2018-05-02 | Paper |
| The modal logic of arithmetic potentialism and the universal algorithm | 2018-01-14 | Paper |
| Computable quotient presentations of models of arithmetic and set theory | 2017-12-20 | Paper |
| The universal finite set | 2017-11-21 | Paper |
| Strongly uplifting cardinals and the boldface resurrection axioms | 2017-10-09 | Paper |
| The set-theoretic universe $V$ is not necessarily a class-forcing extension of HOD | 2017-09-18 | Paper |
| Open determinacy for class games | 2017-08-30 | Paper |
| Set-theoretic mereology | 2017-08-11 | Paper |
| The modal logic of set-theoretic potentialism and the potentialist maximality principles | 2017-08-04 | Paper |
| Boolean ultrapowers, the Bukovsky-Dehornoy phenomenon, and iterated ultrapowers | 2017-07-20 | Paper |
| A model of the generic Vop\v{e}nka principle in which the ordinals are not Mahlo | 2017-06-02 | Paper |
| The inclusion relations of the countable models of set theory are all isomorphic | 2017-04-14 | Paper |
| The Rearrangement Number | 2016-12-22 | Paper |
| What is the theory without power set? | 2016-10-24 | Paper |
| Algebraicity and implicit definability in set theory | 2016-09-01 | Paper |
| The Ground Axiom | 2016-07-03 | Paper |
| The Vop\v{e}nka principle is inequivalent to but conservative over the Vop\v{e}nka scheme | 2016-06-12 | Paper |
| Superstrong and other large cardinals are never Laver indestructible | 2016-03-02 | Paper |
| Infinite time Turing machines and an application to the hierarchy of equivalence relations on the reals | 2016-01-27 | Paper |
| Upward closure and amalgamation in the generic multiverse of a countable model of set theory | 2015-11-03 | Paper |
| A position in infinite chess with game value $\omega^4$ | 2015-10-27 | Paper |
| Structural connections between a forcing class and its modal logic | 2015-09-29 | Paper |
| The least weakly compact cardinal can be unfoldable, weakly measurable and nearly \(\theta\)-supercompact | 2015-09-01 | Paper |
| Large cardinals need not be large in HOD | 2015-08-21 | Paper |
| Is the dream solution of the continuum hypothesis attainable? | 2015-05-22 | Paper |
| The foundation axiom and elementary self-embeddings of the universe | 2015-04-09 | Paper |
| A MULTIVERSE PERSPECTIVE ON THE AXIOM OF CONSTRUCTIBILITY | 2015-03-16 | Paper |
| Set-theoretic geology | 2015-02-04 | Paper |
| Moving Up and Down in the Generic Multiverse | 2015-01-06 | Paper |
| Transfinite game values in infinite chess | 2014-08-04 | Paper |
| Resurrection axioms and uplifting cardinals | 2014-05-12 | Paper |
| EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE | 2014-03-10 | Paper |
| Singular cardinals and strong extenders | 2013-12-09 | Paper |
| Satisfaction is not absolute | 2013-12-02 | Paper |
| The Set-theoretic Multiverse : A Natural Context for Set Theory(<Special Section>Mathematical Logic and Its Applications) | 2013-07-10 | Paper |
| Pointwise definable models of set theory | 2013-04-23 | Paper |
| The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility | 2013-01-30 | Paper |
| The rigid relation principle, a new weak choice principle | 2012-12-10 | Paper |
| THE SET-THEORETIC MULTIVERSE | 2012-10-23 | Paper |
| Generalizations of the Kunen inconsistency | 2012-10-11 | Paper |
| The Mate-in-n Problem of Infinite Chess Is Decidable | 2012-08-14 | Paper |
| Well-founded Boolean ultrapowers as large cardinal embeddings | 2012-06-26 | Paper |
| Inner models with large cardinal features usually obtained by forcing | 2012-05-03 | Paper |
| Infinite time decidable equivalence relation theory | 2011-06-03 | Paper |
| A natural model of the multiverse axioms | 2010-12-01 | Paper |
| Indestructible strong unfoldability | 2010-08-20 | Paper |
| Post's problem for ordinal register machines: an explicit approach | 2009-10-26 | Paper |
| Degrees of rigidity for Souslin trees | 2009-06-04 | Paper |
| The proper and semi-proper forcing axioms for forcing notions that preserve ℵ₂ or ℵ₃ | 2009-05-05 | Paper |
| A Survey of Infinite Time Turing Machines | 2009-03-05 | Paper |
| Some Second Order Set Theory | 2009-02-12 | Paper |
| Tall cardinals | 2009-01-23 | Paper |
| The ground axiom is consistent with V $\neq $ HOD | 2008-08-07 | Paper |
| Changing the heights of automorphism towers by forcing with Souslin trees over L | 2008-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5384986 | 2008-04-29 | Paper |
| The modal logic of forcing | 2008-01-21 | Paper |
| Post’s Problem for Ordinal Register Machines | 2007-11-13 | Paper |
| The Complexity of Quickly ORM-Decidable Sets | 2007-11-13 | Paper |
| The halting problem is decidable on a set of asymptotic probability one | 2007-08-01 | Paper |
| Large cardinals with few measures | 2007-04-18 | Paper |
| Diamond (on the regulars) can fail at any strongly unfoldable cardinal | 2007-02-02 | Paper |
| P ≠ NP ∩ co-NP for Infinite Time Turing Machines | 2006-03-09 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal | 2005-09-26 | Paper |
| A simple maximality principle | 2005-02-09 | Paper |
| Exactly controlling the non-supercompact strongly compact cardinals | 2005-02-09 | Paper |
| Extensions with the approximation and cover properties have no new large cardinals | 2004-08-19 | Paper |
| Unfoldable cardinals and the GCH | 2003-12-01 | Paper |
| Pf ≠ NPf for almost all f | 2003-11-10 | Paper |
| P is not equal to NP intersect coNP for Infinite Time Turing Machines | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4805392 | 2003-05-14 | Paper |
| Gap forcing | 2003-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4781760 | 2003-03-18 | Paper |
| P^f is not equal to NP^f for almost all f | 2002-12-03 | Paper |
| Supertask Computation | 2002-12-03 | Paper |
| A class of strong diamond principles | 2002-11-26 | Paper |
| Indestructibility and the level-by-level agreement between strong compactness and supercompactness | 2002-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2765579 | 2002-09-16 | Paper |
| Infinite Time Turing Machines With Only One Tape | 2002-06-05 | Paper |
| Infinite time Turing machines | 2001-06-18 | Paper |
| The wholeness axioms and V=HOD | 2001-03-28 | Paper |
| The lottery preparation | 2000-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4951682 | 2000-11-27 | Paper |
| Changing the heights of automorphism towers | 2000-09-20 | Paper |
| Small forcing creates neither strong nor Woodin cardinals | 2000-09-03 | Paper |
| Gap Forcing: Generalizing the Lévy-Solovay Theorem | 2000-03-29 | Paper |
| Destruction or preservation as you like it | 1999-06-24 | Paper |
| Superdestructibility: A dual to Laver's indestructibility | 1998-12-15 | Paper |
| Every group has a terminating transfinite automorphism tower | 1998-09-22 | Paper |
| Small forcing makes any cardinal superdestructible | 1998-07-29 | Paper |
| Canonical seeds and Prikry trees | 1998-06-23 | Paper |
| Fragile measurability | 1994-05-18 | Paper |
