We describe techniques for constructing models of size continuum in ω steps by simultaneously building a perfect set of enmeshed countable Henkin sets. Such models have perfect, asymptotically similar subsets. We survey applications involving Borel models, atomic models, two-cardinal transfers and models respecting various closure relations.

The HOD Dichotomy Theorem states that if there is an extendible cardinal, δ, then either HOD is “close” to V (in the sense that it correctly computes successors of singular cardinals greater than δ) or HOD is “far” from V (in the sense that all regular cardinals greater than or equal to δ are measurable in HOD). The question is whether the future will lead to the first or the second side of the dichotomy. Is HOD “close” to V, or “far” from V? There is a program aimed at establishing the first alternative—the “close” side of the HOD Dichotomy. This is the program of inner model theory. In recent years the third author has provided evidence that there is an ultimate inner model—Ultimate-L—and he has isolated a natural conjecture associated with the model—the Ultimate-L Conjecture. This conjecture implies that (assuming the existence of an extendible cardinal) that the first alternative holds—HOD is “close” to V. This is the future in which pattern prevails. In this paper we introduce a very different program, one aimed at establishing the second alternative—the “far” side of the HOD Dichotomy. This is the program of large cardinals beyond choice. Kunen famously showed that if AC holds then there cannot be a Reinhardt cardinal. It has remained open whether Reinhardt cardinals are consistent in ZF alone. It turns out that there is an entire hierarchy of choiceless large cardinals of which Reinhardt cardinals are only the beginning, and, surprisingly, this hierarchy appears to be highly ordered and amenable to systematic investigation, as we shall show in this paper. The point is that if these choiceless large cardinals are consistent then the Ultimate-L Conjecture must fail. This is the future where chaos prevails.

The survey contains a detailed discussion of methods and results in the new emerging area of online “punctual” structure theory. We also state several open problems.

J. L. Krivine developed a new method based on realizability to construct models of set theory where the axiom of choice fails. We attempt to recreate his results in classical settings, i.e., symmetric extensions. We also provide a new condition for preserving well ordered, and other particular type of choice, in the general settings of symmetric extensions.

About 25 years ago, it came to light that a single combinatorial property determines both an important dividing line in model theory (NIP) and machine learning (PAC-learnability). The following years saw a fruitful exchange of ideas between PAC-learning and the model theory of NIP structures. In this article, we point out a new and similar connection between model theory and machine learning, this time developing a correspondence between stability and learnability in various settings of online learning. In particular, this gives many new examples of mathematically interesting classes which are learnable in the online setting.

We survey the history of Shelah’s conjecture on strongly dependent fields, give an equivalent formulation in terms of a classification of strongly dependent fields and prove that the conjecture implies that every strongly dependent field has finite dp-rank.

We present an introductory survey to first order logic for metric structures and its applications to C*-algebras.

In 1936, Gerhard Gentzen published a proof of consistency for Peano Arithmetic using transfinite induction up to ε0, which was considered a finitistically acceptable procedure by both Gentzen and Paul Bernays. Gentzen’s method of arithmetising ordinals and thus avoiding the Platonistic metaphysics of set theory traces back to the 1920s, when Bernays and David Hilbert used the method for an attempted proof of the Continuum Hypothesis. The idea that recursion on higher types could be used to simulate the limit-building in transfinite recursion seems to originate from Bernays. The main difficulty, which was already discovered in Gabriel Sudan’s nearly forgotten paper of 1927, was that measuring transfinite ordinals requires stronger methods than representing them. This paper presents a historical account of the idea of nominalistic ordinals in the context of the Hilbert Programme as well as Gentzen and Bernays’ finitary interpretation of transfinite induction.

By considering the new notion of the inverses of syllogisms such as Barbara and Celarent, we show how the rule of Indirect Proof, in the form (no multiple or vacuous discharges) used by Aristotle, may be dispensed with, in a system comprising four basic rules of subalternation or conversion and six basic syllogisms.

The eta rule for a set A says that an arbitrary element of A is judgementally identical to an element of constructor form. Eta rules are not part of what may be called canonical Martin-Löf type theory. They are, however, justified by the meaning explanations, and a higher order eta rule is part of that type theory. The main aim of this article is to clarify this somewhat puzzling situation. It will be argued that lower order eta rules do not, whereas the higher order eta rule does, accord with the understanding of judgemental identity as definitional identity. A subsidiary aim is to clarify precisely what an eta rule is. This will involve showing how such rules relate to various other notions of type theory, proof theory, and category theory.

We show that if $(M,{ \in _1},{ \in _2})$ satisfies the first-order Zermelo–Fraenkel axioms of set theory when the membership relation is ${ \in _1}$ and also when the membership relation is ${ \in _2}$, and in both cases the formulas are allowed to contain both ${ \in _1}$ and ${ \in _2}$, then $\left( {M, \in _1 } \right) \cong \left( {M, \in _2 } \right)$, and the isomorphism is definable in $(M,{ \in _1},{ \in _2})$. This extends Zermelo’s 1930 theorem in [6].