Matthias Schröder has asked the question whether there is a weakest discontinuous problem in the topological version of the Weihrauch lattice. Such a problem can be considered as the weakest unsolvable problem. We introduce the discontinuity problem, and we show that it is reducible exactly to the effectively discontinuous problems, defined in a suitable way. However, in which sense this answers Schröder’s question sensitively depends on the axiomatic framework that is chosen, and it is a positive answer if we work in Zermelo–Fraenkel set theory with dependent choice and the axiom of determinacy $\mathsf {AD}$. On the other hand, using the full axiom of choice, one can construct problems which are discontinuous, but not effectively so. Hence, the exact situation at the bottom of the Weihrauch lattice sensitively depends on the axiomatic setting that we choose. We prove our result using a variant of Wadge games for mathematical problems. While the existence of a winning strategy for Player II characterizes continuity of the problem (as already shown by Nobrega and Pauly), the existence of a winning strategy for Player I characterizes effective discontinuity of the problem. By Weihrauch determinacy we understand the condition that every problem is either continuous or effectively discontinuous. This notion of determinacy is a fairly strong notion, as it is not only implied by the axiom of determinacy $\mathsf {AD}$, but it also implies Wadge determinacy. We close with a brief discussion of generalized notions of productivity.

Assume $\mathsf {ZF} + \mathsf {AD}$ and all sets of reals are Suslin. Let $\Gamma $ be a pointclass closed under $\wedge $, $\vee $, $\forall ^{\mathbb {R}}$, continuous substitution, and has the scale property. Let $\kappa = \delta (\Gamma )$ be the supremum of the length of prewellorderings on $\mathbb {R}$ which belong to $\Delta = \Gamma \cap \check \Gamma $. Let $\mathsf {club}$ denote the collection of club subsets of $\kappa $. Then the countable length everywhere club uniformization holds for $\kappa $: For every relation $R \subseteq {}^{<{\omega _1}}\kappa \times \mathsf {club}$ with the property that for all $\ell \in {}^{<{\omega _1}}\kappa $ and clubs $C \subseteq D \subseteq \kappa $, $R(\ell ,D)$ implies $R(\ell ,C)$, there is a uniformization function $\Lambda : \mathrm {dom}(R) \rightarrow \mathsf {club}$ with the property that for all $\ell \in \mathrm {dom}(R)$, $R(\ell ,\Lambda (\ell ))$. In particular, under these assumptions, for all $n \in \omega $, $\boldsymbol {\delta }^1_{2n + 1}$ satisfies the countable length everywhere club uniformization.

Building on Pierre Simon’s notion of distality, we introduce distality rank as a property of first-order theories and give examples for each rank m such that $1\leq m \leq \omega $ . For NIP theories, we show that distality rank is invariant under base change. We also define a generalization of type orthogonality called m-determinacy and show that theories of distality rank m require certain products to be m-determined. Furthermore, for NIP theories, this behavior characterizes m-distality. If we narrow the scope to stable theories, we observe that m-distality can be characterized by the maximum cycle size found in the forking “geometry,” so it coincides with $(m-1)$ -triviality. On a broader scale, we see that m-distality is a strengthening of Saharon Shelah’s notion of m-dependence.

We prove two general results about the preservation of extendible and $C^{(n)}$ -extendible cardinals under a wide class of forcing iterations (Theorems 5.4 and 7.5). As applications we give new proofs of the preservation of Vopěnka’s Principle and $C^{(n)}$ -extendible cardinals under Jensen’s iteration for forcing the GCH [17], previously obtained in [8, 27], respectively. We prove that $C^{(n)}$ -extendible cardinals are preserved by forcing with standard Easton-support iterations for any possible $\Delta _2$ -definable behaviour of the power-set function on regular cardinals. We show that one can force proper class-many disagreements between the universe and HOD with respect to the calculation of successors of regular cardinals, while preserving $C^{(n)}$ -extendible cardinals. We also show, assuming the GCH, that the class forcing iteration of Cummings–Foreman–Magidor for forcing $\diamondsuit _{\kappa ^+}^+$ at every $\kappa $ [10] preserves $C^{(n)}$ -extendible cardinals. We give an optimal result on the consistency of weak square principles and $C^{(n)}$ -extendible cardinals. In the last section prove another preservation result for $C^{(n)}$ -extendible cardinals under very general (not necessarily definable or weakly homogeneous) class forcing iterations. As applications we prove the consistency of $C^{(n)}$ -extendible cardinals with $\mathrm {{V}}=\mathrm {{HOD}}$ , and also with $\mathrm {GA}$ (the Ground Axiom) plus $\mathrm {V}\neq \mathrm {HOD}$ , the latter being a strengthening of a result from [14].

We prove some results about the model theory of fields with a derivation of the Frobenius map, especially that the model companion of this theory is axiomatizable by axioms used by Wood in the case of the theory $\operatorname {DCF}_p$ and that it eliminates quantifiers after adding the inverse of the Frobenius map to the language. This strengthens the results from [4]. As a by-product, we get a new geometric axiomatization of this model companion. Along the way we also prove a quantifier elimination result, which holds in a much more general context and we suggest a way of giving “one-dimensional” axiomatizations for model companions of some theories of fields with operators.

A Leibniz class is a class of logics closed under the formation of term-equivalent logics, compatible expansions, and non-indexed products of sets of logics. We study the complete lattice of all Leibniz classes, called the Leibniz hierarchy. In particular, it is proved that the classes of truth-equational and assertional logics are meet-prime in the Leibniz hierarchy, while the classes of protoalgebraic and equivalential logics are meet-reducible. However, the last two classes are shown to be determined by Leibniz conditions consisting of meet-prime logics only.

Strong Turing Determinacy, or ${\mathrm {sTD}}$, is the statement that for every set A of reals, if $\forall x\exists y\geq _T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing Determinacy (${\mathrm {TD}}$) and ${\mathrm {sTD}}$ over ${\mathrm {ZF}}$—the Zermelo–Fraenkel axiomatic set theory without the Axiom of Choice:

1. (1) ${\mathrm {ZF}}+{\mathrm {TD}}$ implies $\mathrm {wDC}_{\mathbb {R}}$—a weaker version of $\mathrm {DC}_{\mathbb {R}}$.

2. (2) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that every set of reals is measurable and has Baire property.

3. (3) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that every uncountable set of reals has a perfect subset.

4. (4) ${\mathrm {ZF}}+{\mathrm {sTD}}$ implies that for every set of reals A and every $\epsilon>0$:

   1. (a) There is a closed set $F\subseteq A$ such that $\mathrm {Dim_H}(F)\geq \mathrm {Dim_H}(A)-\epsilon $, where $\mathrm {Dim_H}$ is the Hausdorff dimension.

   2. (b) There is a closed set $F\subseteq A$ such that $\mathrm {Dim_P}(F)\geq \mathrm {Dim_P}(A)-\epsilon $, where $\mathrm {Dim_P}$ is the packing dimension.

The current paper studies the formal properties of the Global Reflection Principle, to wit the assertion “All theorems of $\mathrm {Th}$ are true,” where $\mathrm {Th}$ is a theory in the language of arithmetic and the truth predicate satisfies the usual Tarskian inductive conditions for formulae in the language of arithmetic. We fix the gap in Kotlarski’s proof from [15], showing that the Global Reflection Principle for Peano Arithmetic is provable in the theory of compositional truth with bounded induction only ( $\mathrm {CT}_0$ ). Furthermore, we extend the above result showing that $\Sigma _1$ -uniform reflection over a theory of uniform Tarski biconditionals ( $\mathrm {UTB}^-$ ) is provable in $\mathrm {CT}_0$ , thus answering the question of Beklemishev and Pakhomov [2]. Finally, we introduce the notion of a prolongable satisfaction class and use it to study the structure of models of $\mathrm {CT}_0$ . In particular, we provide a new model-theoretical characterization of theories of finite iterations of uniform reflection and present a new proof characterizing the arithmetical consequences of $\mathrm {CT}_0$ .

A permutation group G on a set A is ${\kappa }$ -homogeneous iff for all $X,Y\in \bigl [ {A} \bigr ]^ {\kappa } $ with $|A\setminus X|=|A\setminus Y|=|A|$ there is a $g\in G$ with $g[X]=Y$ . G is ${\kappa }$ -transitive iff for any injective function f with $\operatorname {dom}(f)\cup \operatorname {ran}(f)\in \bigl [ {A} \bigr ]^ {\le {\kappa }} $ and $|A\setminus \operatorname {dom}(f)|=|A\setminus \operatorname {ran}(f)|=|A|$ there is a $g\in G$ with $f\subset g$ .

Giving a partial answer to a question of P. M. Neumann [6] we show that there is an ${\omega }$ -homogeneous but not ${\omega }$ -transitive permutation group on a cardinal ${\lambda }$ provided

1. (i) ${\lambda }<{\omega }_{\omega }$ , or

2. (ii) $2^{\omega }<{\lambda }$ , and ${\mu }^{\omega }={\mu }^+$ and $\Box _{\mu }$ hold for each ${\mu }\le {\lambda }$ with ${\omega }=\operatorname {cf}({\mu })<{{\mu }}$ , or

3. (iii) our model was obtained by adding $(2^{\omega })^+$ many Cohen generic reals to some ground model.

For ${\kappa }>{\omega }$ we give a method to construct large ${\kappa }$ -homogeneous, but not ${\kappa }$ -transitive permutation groups. Using this method we show that there exist ${\kappa }^+$ -homogeneous, but not ${\kappa }^+$ -transitive permutation groups on ${\kappa }^{+n}$ for each infinite cardinal ${\kappa }$ and natural number $n\ge 1$ provided $V=L$ .

We continue our study of strongly unbounded colorings, this time focusing on subadditive maps. In Part I of this series, we showed that, for many pairs of infinite cardinals $\theta < \kappa $, the existence of a strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is a theorem of $\textsf{ZFC}$. Adding the requirement of subadditivity to a strongly unbounded coloring is a significant strengthening, though, and here we see that in many cases the existence of a subadditive strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is independent of $\textsf{ZFC}$. We connect the existence of subadditive strongly unbounded colorings with a number of other infinitary combinatorial principles, including the narrow system property, the existence of $\kappa $-Aronszajn trees with ascent paths, and square principles. In particular, we show that the existence of a closed, subadditive, strongly unbounded coloring $c:[\kappa ]^2 \rightarrow \theta $ is equivalent to a certain weak indexed square principle $\boxminus ^{\operatorname {\mathrm {ind}}}(\kappa , \theta )$. We conclude the paper with an application to the failure of the infinite productivity of $\kappa $-stationarily layered posets, answering a question of Cox.

We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$.

We obtain an array of consistency results concerning trees and stationary reflection at double successors of regular cardinals $\kappa $ , updating some classical constructions in the process. This includes models of $\mathsf {CSR}(\kappa ^{++})\wedge {\sf TP}(\kappa ^{++})$ (both with and without ${\sf AP}(\kappa ^{++})$ ) and models of the conjunctions ${\sf SR}(\kappa ^{++}) \wedge \mathsf {wTP}(\kappa ^{++}) \wedge {\sf AP}(\kappa ^{++})$ and $\neg {\sf AP}(\kappa ^{++}) \wedge {\sf SR}(\kappa ^{++})$ (the latter was originally obtained in joint work by Krueger and the first author [9], and is here given using different methods). Analogs of these results with the failure of $\sf {SH}(\kappa ^{++})$ are given as well. Finally, we obtain all of our results with an arbitrarily large $2^\kappa $ , applying recent joint work by Honzik and the third author.

A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated with arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the corresponding forcing axioms and the corresponding fragments of the strong reflection principle, are analyzed, and consequences are presented. Some of these consequences are “exact” versions of diagonal stationary reflection principles of sets of ordinals. We also separate some of these diagonal strong reflection principles from related axioms.

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj are stable and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický.

Vardanyan’s Theorems [36, 37] state that $\mathsf {QPL}(\mathsf {PA})$—the quantified provability logic of Peano Arithmetic—is $\Pi ^0_2$ complete, and in particular that this already holds when the language is restricted to a single unary predicate. Moreover, Visser and de Jonge [38] generalized this result to conclude that it is impossible to computably axiomatize the quantified provability logic of a wide class of theories. However, the proof of this fact cannot be performed in a strictly positive signature. The system $\mathsf {QRC_1}$ was previously introduced by the authors [1] as a candidate first-order provability logic. Here we generalize the previously available Kripke soundness and completeness proofs, obtaining constant domain completeness. Then we show that $\mathsf {QRC_1}$ is indeed complete with respect to arithmetical semantics. This is achieved via a Solovay-type construction applied to constant domain Kripke models. As corollaries, we see that $\mathsf {QRC_1}$ is the strictly positive fragment of $\mathsf {QGL}$ and a fragment of $\mathsf {QPL}(\mathsf {PA})$.

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to have a model completion, extending a characterization provided by Wheeler. For varieties of algebras that have equationally definable principal congruences and the compact intersection property, these conditions yield a more elegant characterization obtained (in a slightly more restricted setting) by Ghilardi and Zawadowski. Moreover, it is shown that under certain further assumptions on congruence lattices, the existence of a model completion implies that the variety has equationally definable principal congruences. This result is then used to provide necessary and sufficient conditions for the existence of a model completion for theories of Hamiltonian varieties of pointed residuated lattices, a broad family of varieties that includes lattice-ordered abelian groups and MV-algebras. Notably, if the theory of a Hamiltonian variety of pointed residuated lattices has a model completion, it must have equationally definable principal congruences. In particular, the theories of lattice-ordered abelian groups and MV-algebras do not have a model completion, as first proved by Glass and Pierce, and Lacava, respectively. Finally, it is shown that certain varieties of pointed residuated lattices generated by their linearly ordered members, including lattice-ordered abelian groups and MV-algebras, can be extended with a binary operation to obtain theories that do have a model completion.

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete one-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has a Borel complete reduct, and if a theory T is not $\omega $ -stable, then the elementary diagram of some countable model of T has a Borel complete reduct.

We investigate properties of the ineffability and the Ramsey operator, and a common generalization of those that was introduced by the second author, with respect to higher indescribability, as introduced by the first author. This extends earlier investigations on the ineffability operator by James Baumgartner, and on the Ramsey operator by Qi Feng, by Philip Welch et al., and by the first author.

In this paper we study elimination of imaginaries in some classes of pure ordered abelian groups. For the class of ordered abelian groups with bounded regular rank (equivalently with finite spines) we obtain weak elimination of imaginaries once we add sorts for the quotient groups $\Gamma /\Delta $ for each definable convex subgroup $\Delta $, and sorts for the quotient groups $\Gamma /(\Delta + \ell \Gamma )$ where $\Delta $ is a definable convex subgroup and $\ell \in \mathbb {N}_{\geq 2}$. We refer to these sorts as the quotient sorts. For the dp-minimal case we obtain a complete elimination of imaginaries if we also add constants to distinguish the cosets of $\ell \Gamma $ in $\Gamma $, where $\ell \in \mathbb {N}_{\geq 2}$.

Roelcke non-precompactness, simplicity, and non-amenability of the automorphism group of the Fraïssé limit of finite Heyting algebras are proved among others.