In [15] we defined and proved the consistency of the principle $\mathrm {GM}^+(\omega _3,\omega _1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega _2$ and $\omega _3$. In this paper we formulate a strengthening of $\mathrm {GM}^+(\omega _3,\omega _1)$ that we call $\mathrm {SGM}^+(\omega _3,\omega _1)$. We also prove, modulo the consistency of two supercompact cardinals, that $\mathrm {SGM}^+(\omega _3,\omega _1)$ is consistent with ZFC. In addition to all the consequences of $\mathrm {GM}^+(\omega _3,\omega _1)$, the principle $\mathrm {SGM}^+(\omega _3,\omega _1)$, together with some mild cardinal arithmetic assumptions that hold in our model, implies that any forcing that adds a new subset of $\omega _2$ either adds a real or collapses some cardinal. This gives a partial answer to a question of Abraham [1] and extends a previous result of Todorčević [16] in this direction.

We give an update on the problem list of Erdős and Hajnal.

Condensed mathematics, developed by Clausen and Scholze over the last few years, proposes a generalization of topology with better categorical properties. It replaces the concept of a topological space by that of a condensed set, which can be defined as a sheaf for the coherent topology on a certain category of compact Hausdorff spaces. In this case, the sheaf condition has a fairly simple explicit description, which arises from studying the relationship between the coherent, regular, and extensive topologies. In this paper, we establish this relationship under minimal assumptions on the category, going beyond the case of compact Hausdorff spaces. Along the way, we also provide a characterization of sheaves and covering sieves for these categories. All results in this paper have been fully formalized in the Lean proof assistant.

I apply truthmaker semantics to the logic of conditional imperatives.

The generic multiverse was introduced in [74] and [81] to explicate the portion of mathematics which is immune to our independence techniques. It consists, roughly speaking, of all universes of sets obtainable from a given universe by forcing extension. Usuba recently showed that the generic multiverse contains a unique definable universe, assuming strong large cardinal hypotheses. On the basis of this theorem, a non-pluralist about set theory could dismiss the generic multiverse as irrelevant to what set theory is really about, namely that unique definable universe. Whatever one’s attitude towards the generic multiverse, we argue that certain impure proofs ensure its ongoing relevance to the foundations of set theory. The proofs use forcing-fragile theories and absoluteness to prove ${\mathrm {ZFC}}$ theorems about simple “concrete” objects.

This paper investigates the univocity (or uniqueness) of connectives in intuitionistic and classical sentential logic. Specifically, unlike Gentzen systems, Hilbert systems for (various fragments of) intuitionistic and classical logic do not always determine univocal (or unique) conditional connectives. This paper explains when univocal conditional connectives are achieved in Hilbert systems for intuitionistic and classical sentential logic (and when they are not). In the final section, we discuss the (non-)univocity of the Sheffer stroke in Hilbert vs. Gentzen systems for classical sentential logic.

The distinction between the proofs that only certify the truth of their conclusion and those that also display the reasons why their conclusion holds has a long philosophical history. In the contemporary literature, the grounding relation—an objective, explanatory relation which is tightly connected with the notion of reason—is receiving considerable attention in several fields of philosophy. While much work is being devoted to characterising logical grounding in terms of deduction rules, no in-depth study focusing on the difference between grounding rules and logical rules exists. In this work, we analyse the relation between logical grounding and classical logic by focusing on the technical and conceptual differences that distinguish grounding rules and logical rules. The calculus employed to conduct the analysis provides moreover a strong confirmation of the fact that grounding derivations are logical derivations of a certain kind, without trivialising the distinction between grounding and logical rules, explanatory and non-explanatory parts of a derivation. By a further formal analysis, we negatively answer the question concerning the possible correspondence between grounding rules and intuitionistic logical rules.

Structural convergence is a framework for the convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence. They posed a problem asking whether for a given sequence of graphs $(G_n)$ converging to a limit $L$ and a vertex $r$ of $L$, it is possible to find a sequence of vertices $(r_n)$ such that $L$ rooted at $r$ is the limit of the graphs $G_n$ rooted at $r_n$. A counterexample was found by Christofides and Král’, but they showed that the statement holds for almost all vertices $r$ of $L$. We offer another perspective on the original problem by considering the size of definable sets to which the root $r$ belongs. We prove that if $r$ is an algebraic vertex (i.e. belongs to a finite definable set), the sequence of roots $(r_n)$ always exists.

It is a classic result of Segerberg and Maksimova that a variety of $\mathsf {S4}$-algebras is locally finite iff it is of finite depth. Since the logic $\mathsf {MS4}$ (monadic $\mathsf {S4}$) axiomatizes the one-variable fragment of $\mathsf {QS4}$ (predicate $\mathsf {S4}$), it is natural to try to generalize the Segerberg–Maksimova theorem to this setting. We obtain several results in this direction. Our positive results include the identification of the largest semisimple variety of $\mathsf {MS4}$-algebras. We prove that the corresponding logic $\mathsf {MS4_S}$ has the finite model property. We show that both $\mathsf {S5}^2$ and $\mathsf {S4}_u$ are proper extensions of $\mathsf {MS4_S}$, and that a direct generalization of the Segerberg–Maksimova theorem holds for a family of varieties containing the variety of $\mathsf {S4}_u$-algebras. Our negative results include a translation of varieties of $\mathsf {S5}_2$-algebras into varieties of $\mathsf {MS4_S}$-algebras of depth 2, which preserves and reflects local finiteness. This, in particular, shows that the problem of characterizing locally finite varieties of $\mathsf {MS4}$-algebras (even of $\mathsf {MS4_S}$-algebras) is at least as hard as that of characterizing locally finite varieties of $\mathsf {S5}_2$-algebras—a problem that remains wide open.

We provide a characterization of differentially large fields in arbitrary characteristic and a single derivation in the spirit of Blum axioms for differentially closed fields. In the case of characteristic zero, we use these axioms to characterize differential largeness in terms of being existentially closed in the differential algebraic Laurent series ring, and we prove that any large field of infinite transcendence degree can be expanded to a differentially large field even under certain prescribed constant fields. As an application, we show that the theory of proper dense pairs of models of a complete and model-complete theory of large fields, is a complete theory. As a further consequence of the expansion result we show that there is no real closed and differential field that has a prime model extension in closed ordered differential fields, unless it is itself a closed ordered differential field.

We study the question of $\mathcal {L}_{\mathrm {ring}}$-definability of non-trivial henselian valuation rings. Building on previous work of Jahnke and Koenigsmann, we provide a characterization of henselian fields that admit a non-trivial definable henselian valuation. In particular, we treat the cases where the canonical henselian valuation has positive residue characteristic, using techniques from the model theory and algebra of tame fields.

If G is any infinite-valued Gödel logic with identity, then the compactness cardinal of G is the least $\omega _1$-strongly compact cardinal.

Inquisitive modal logic, InqML, in its epistemic incarnation, extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. We use the natural notion of bisimulation equivalence in the setting of InqML, as introduced in [7], to characterise the expressiveness of InqML as the bisimulation invariant fragment of first-order logic over natural classes of two-sorted first-order structures that arise as relational encodings of inquisitive epistemic (S5-like) models. The non-elementary nature of these classes crucially requires non-classical model-theoretic methods for the analysis of first-order expressiveness, irrespective of whether we aim for characterisations in the sense of classical or of finite model theory.

The seminal Krajewski–Kotlarski–Lachlan theorem (1981) states that every countable recursively saturated model of $\mathsf {PA}$ (Peano arithmetic) carries a full satisfaction class. This result implies that the compositional theory of truth over $\mathsf {PA}$ commonly known as $\mathsf {CT}^{-}[\mathsf {PA}]$ is conservative over $\mathsf {PA}$. In contrast, Pakhomov and Enayat (2019) showed that the addition of the so-called axiom of disjunctive correctness (that asserts that a finite disjunction is true iff one of its disjuncts is true) to $\mathsf {CT}^{-}[\mathsf {PA}]$ axiomatizes the theory of truth $\mathsf {CT}_{0}[\mathsf {PA}]$ that was shown by Wcisło and Łełyk (2017) to be nonconservative over $\mathsf {PA}$. The main result of this paper (Theorem 3.12) provides a foil to the Pakhomov–Enayat theorem by constructing full satisfaction classes over arbitrary countable recursively saturated models of $\mathsf {PA}$ that satisfy arbitrarily large approximations of disjunctive correctness. This shows that in the Pakhomov–Enayat theorem the assumption of disjunctive correctness cannot be replaced with any of its approximations.

The complex field, equipped with the multivalued functions of raising to each complex power, is quasiminimal, proving a conjecture of Zilber and providing evidence towards his stronger conjecture that the complex exponential field is quasiminimal.

We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with a particular emphasis on the set $D'$ comprised of differences between successive elements. In particular, if the burden of the structure is at most n, then the result of applying the operation $D \mapsto D'\ n$ times must be a finite set (Theorem 1.1). In the case when the structure is densely ordered and has burden $2$, we show that any definable unary discrete set must be definable in some elementary extension of the structure $\langle \mathbb{R}; <, +, \mathbb{Z} \rangle $ (Theorem 1.3).

We study possible Scott sentence complexities of linear orderings using two approaches. First, we investigate the effect of the Friedman–Stanley embedding on Scott sentence complexity and show that it only preserves $\Pi ^{\mathrm {in}}_{\alpha }$ complexities. We then take a more direct approach and exhibit linear orderings of all Scott sentence complexities except $\Sigma ^{\mathrm {in}}_{3}$ and $\Sigma ^{\mathrm {in}}_{\lambda +1}$ for $\lambda $ a limit ordinal. We show that the former cannot be the Scott sentence complexity of a linear ordering. In the process we develop new techniques which appear to be helpful to calculate the Scott sentence complexities of structures.

In this paper, we study the employment of $\Sigma _1$-sentences with certificates, i.e., $\Sigma _1$-sentences where a number of principles is added to ensure that the witness is sufficiently number-like. We develop certificates in some detail and illustrate their use by reproving some classical results and proving some new ones. An example of such a classical result is Vaught’s theorem of the strong effective inseparability of $\mathsf {R}_0$.

We also develop the new idea of a theory being $\mathsf {R}_{0\mathsf {p}}$-sourced. Using this notion, we can transfer a number of salient results from $\mathsf {R}_0$ to a variety of other theories.

Several structural results about permutation groups of finite rank definable in differentially closed fields of characteristic zero (and other similar theories) are obtained. In particular, it is shown that every finite rank definably primitive permutation group is definably isomorphic to an algebraic permutation group living in the constants. Applications include the verification, in differentially closed fields, of the finite Morley rank permutation group conjectures of Borovik-Deloro and Borovik-Cherlin. Applying the results to binding groups for internality to the constants, it is deduced that if complete types p and q are of rank m and n, respectively, and are nonorthogonal, then the $(m+3)$rd Morley power of p is not weakly orthogonal to the $(n+3)$rd Morley power of q. An application to transcendence of generic solutions of pairs of algebraic differential equations is given.

For relevant logics, the admissibility of the rule of proof $\gamma $ has played a significant historical role in the development of relevant logics. For first-order logics, however, there have been only a handful of $\gamma $-admissibility proofs for a select few logics. Here we show that, for each logic L of a wide range of propositional relevant logics for which excluded middle is valid (with fusion and the Ackermann truth constant), the first-order extensions QL and LQ admit $\gamma $. Specifically, these are particular “conventionally normal” extensions of the logic $\mathbf {G}^{g,d}$, which is the least propositional relevant logic (with the usual relational semantics) that admits $\gamma $ by the method of normal models. We also note the circumstances in which our results apply to logics without fusion and the Ackermann truth constant.