Inspired by Adler’s idea on VC minimal theories [1], we introduce VC-minimal complexity. We show that for any $N\in \mathbb {N}^{>0}$, there is $k_N>0$ such that for any finite bipartite graph $(X,Y;E)$ with VC-minimal complexity $< N$, there exist $X'\subseteq X$, $Y'\subseteq Y$ with $|X'|\geq k_N |X|$, $|Y'|\geq k_N |Y|$ such that $X'\times Y' \subseteq E$ or $X'\times Y'\cap E=\emptyset $.

Let ${\mathbb K}$ be an algebraically bounded structure, and let T be its theory. If T is model complete, then the theory of ${\mathbb K}$ endowed with a derivation, denoted by $T^{\delta }$, has a model completion. Additionally, we prove that if the theory T is stable/NIP then the model completion of $T^{\delta }$ is also stable/NIP. Similar results hold for the theory with several derivations, either commuting or non-commuting.

We generalize Hrushovski’s group configuration theorem to the case where the type of the configuration is generically stable, without assuming tameness of the ambient theory. The properties of generically stable types, which we recall in the second section, enable us to adapt the proof known in the stable context.

In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms specifically concerning urelements. We prove that these axioms form a hierarchy over $\text {ZFCU}_{\text {R}}$ (ZFC with urelements formulated with Replacement) in terms of direct implication. The second part of the paper studies forcing over countable transitive models of $\text {ZFU}_{\text {R}}$. We propose a new definition of ${\mathbb P}$-names to address an issue with the existing approach. We then prove the fundamental theorem of forcing with urelements regarding axiom preservation. Moreover, we show that forcing can destroy and recover certain axioms within the previously established hierarchy. Finally, we demonstrate how ground model definability may fail when the ground model contains a proper class of urelements.

We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space. As a corollary, we prove a partial converse to the Feldman–Moore theorem, which allows us to characterize all locally countable Borel line graphs in terms of their Borel chromatic numbers.

We introduce and study the notion of a generalised Hecke orbit in a Shimura variety. We define a height function on such an orbit and study its properties. We obtain lower bounds for the sizes of Galois orbits of points in a generalised Hecke orbit in terms of this height function, assuming the ‘weakly adelic Mumford–Tate hypothesis’ and prove the generalised André–Pink–Zannier conjecture under this assumption, using Pila–Zannier strategy.

All spaces are assumed to be Tychonoff. Given a realcompact space X, we denote by $\mathsf {Exp}(X)$ the smallest infinite cardinal $\kappa $ such that X is homeomorphic to a closed subspace of $\mathbb {R}^\kappa $. Our main result shows that, given a cardinal $\kappa $, the following conditions are equivalent:

• • There exists a countable crowded space X such that $\mathsf {Exp}(X)=\kappa $.

• • $\mathfrak {p}\leq \kappa \leq \mathfrak {c}$.

$\mathfrak {d}\leq \kappa \leq \mathfrak {c}$

$2^\kappa $

$\kappa $

$\kappa $

$\mathsf {Exp}(X)$

For a space X let $\mathcal {K}(X)$ be the set of compact subsets of X ordered by inclusion. A map $\phi :\mathcal {K}(X) \to \mathcal {K}(Y)$ is a relative Tukey quotient if it carries compact covers to compact covers. When there is such a Tukey quotient write $(X,\mathcal {K}(X)) \ge _T (Y,\mathcal {K}(Y))$, and write $(X,\mathcal {K}(X)) =_T (Y,\mathcal {K}(Y))$ if $(X,\mathcal {K}(X)) \ge _T (Y,\mathcal {K}(Y))$ and vice versa.

We investigate the initial structure of pairs $(X,\mathcal {K}(X))$ under the relative Tukey order, focussing on the case of separable metrizable spaces. Connections are made to Menger spaces.

Applications are given demonstrating the diversity of free topological groups, and related free objects, over separable metrizable spaces. It is shown a topological group G has the countable chain condition if it is either $\sigma $-pseudocompact or for some separable metrizable M, we have $\mathcal {K}(M) \ge _T (G,\mathcal {K}(G))$.

For any $n<\omega $ we construct an infinite $(n+1)$-generated Heyting algebra whose n-generated subalgebras are of cardinality $\leq m_n$ for some positive integer $m_n$. From this we conclude that for every $n<\omega $ there exists a variety of Heyting algebras which contains an infinite $(n+1)$-generated algebra, but which contains only finite n-generated algebras. For the case $n=2$ this provides a negative answer to a question posed by G. Bezhanishvili and R. Grigolia in [4].

We show that there exists a recursive coloring function c such that any $\Pi ^0_3$ set is not a solution to c for Hindman’s theorem. We also show that there exists a recursive coloring function c such that any $\Delta ^0_3$ set is not a solution to c for Hindman’s theorem restricted to sums of at most three numbers.

Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.

All the known non-self-referential paradoxes share a reference pattern of Yablo’s paradox in that they all necessarily contain infinitely many sentences, each of which refers to infinitely many sentences. This raises a question: Does the reference pattern of Yablo’s paradox underlie all non-self-referential paradoxes, just as the reference pattern of the liar paradox underlies all finite paradoxes? In this regard, Rabern et al. [J Philos Logic 42(5): 727–765, 2013] prove that every dangerous acyclic digraph contains infinitely many points with an infinite out-degree. Building upon their work, this paper extends Rabern et al.’s result to the first-order arithmetic language with a primitive truth predicate, proving that all reference digraphs for non-self-referential paradoxes contain infinitely many sentences of infinite out-degree (called “social sentences”). We then strengthen this result in two respects. First, among these social sentences, infinitely many appear in one ray. Second, among these social sentences, infinitely many have infinitely many out-neighbors, none of which will eventually get to a sink. These observations provide helpful information towards the following conjecture proposed by Beringer and Schindler [Bull. of Symb. Logic 23(4): 442–492, 2017]: every dangerous acyclic digraph contains the Yablo digraph as a finitary minor.

We study the parameterized complexity of the problem to decide whether a given natural number n satisfies a given $\Delta _0$-formula $\varphi (x)$; the parameter is the size of $\varphi $. This parameterization focusses attention on instances where n is large compared to the size of $\varphi $. We show unconditionally that this problem does not belong to the parameterized analogue of $\mathsf {AC}^0$. From this we derive that certain natural upper bounds on the complexity of our parameterized problem imply certain separations of classical complexity classes. This connection is obtained via an analysis of a parameterized halting problem. Some of these upper bounds follow assuming that $I\Delta _0$ proves the MRDP theorem in a certain weak sense.

We show that an infinite group G definable in a $1$-h-minimal field admits a strictly K-differentiable structure with respect to which G is a (weak) Lie group, and we show that definable local subgroups sharing the same Lie algebra have the same germ at the identity. We conclude that infinite fields definable in K are definably isomorphic to finite extensions of K and that $1$-dimensional groups definable in K are finite-by-abelian-by-finite. Along the way, we develop the basic theory of definable weak K-manifolds and definable morphisms between them.

This is the second installment in a series of papers applying descriptive set theoretic techniques to both analyze and enrich classical functors from homological algebra and algebraic topology. In it, we show that the Čech cohomology functors on the category of locally compact separable metric spaces each factor into (i) what we term their definable version, a functor taking values in the category $\mathsf {GPC}$ of groups with a Polish cover (a category first introduced in this work’s predecessor), followed by (ii) a forgetful functor from $\mathsf {GPC}$ to the category of groups. These definable cohomology functors powerfully refine their classical counterparts: we show that they are complete invariants, for example, of the homotopy types of mapping telescopes of d-spheres or d-tori for any $d\geq 1$, and, in contrast, that there exist uncountable families of pairwise homotopy inequivalent mapping telescopes of either sort on which the classical cohomology functors are constant. We then apply the functors to show that a seminal problem in the development of algebraic topology – namely, Borsuk and Eilenberg’s 1936 problem of classifying, up to homotopy, the maps from a solenoid complement $S^3\backslash \Sigma $ to the $2$-sphere – is essentially hyperfinite but not smooth.

Fundamental to our analysis is the fact that the Čech cohomology functors admit two main formulations: a more combinatorial one and a more homotopical formulation as the group $[X,P]$ of homotopy classes of maps from X to a polyhedral $K(G,n)$ space P. We describe the Borel-definable content of each of these formulations and prove a definable version of Huber’s theorem reconciling the two. In the course of this work, we record definable versions of Urysohn’s Lemma and the simplicial approximation and homotopy extension theorems, along with a definable Milnor-type short exact sequence decomposition of the space $\mathrm {Map}(X,P)$ in terms of its subset of phantom maps; relatedly, we provide a topological characterization of this set for any locally compact Polish space X and polyhedron P. In aggregate, this work may be more broadly construed as laying foundations for the descriptive set theoretic study of the homotopy relation on such spaces $\mathrm {Map}(X,P)$, a relation which, together with the more combinatorial incarnation of , embodies a substantial variety of classification problems arising throughout mathematics. We show, in particular, that if P is a polyhedral H-group, then this relation is both Borel and idealistic. In consequence, $[X,P]$ falls in the category of definable groups, an extension of the category $\mathsf {GPC}$ introduced herein for its regularity properties, which facilitate several of the aforementioned computations.

We give explicit formulas witnessing IP, IP$_{\!n}$, or TP2 in fields with Artin–Schreier extensions. We use them to control p-extensions of mixed characteristic henselian valued fields, allowing us most notably to generalize to the NIP$_{\!n}$ context one way of Anscombe–Jahnke’s classification of NIP henselian valued fields. As a corollary, we obtain that NIP$_{\!n}$ henselian valued fields with NIP residue field are NIP. We also discuss tameness results for NTP2 henselian valued fields.

This paper proves normalisation theorems for intuitionist and classical negative free logic, without and with the operator for definite descriptions. Rules specific to free logic give rise to new kinds of maximal formulas additional to those familiar from standard intuitionist and classical logic. When is added it must be ensured that reduction procedures involving replacements of parameters by terms do not introduce new maximal formulas of higher degree than the ones removed. The problem is solved by a rule that permits restricting these terms in the rules for $\forall $, $\exists $ and to parameters or constants. A restricted subformula property for deductions in systems without is considered. It is improved upon by an alternative formalisation of free logic building on an idea of Jaśkowski’s. In the classical system the rules for require treatment known from normalisation for classical logic with $\lor $ or $\exists $. The philosophical significance of the results is also indicated.

Continuous functions on the unit interval are relatively tame from the logical and computational point of view. A similar behaviour is exhibited by continuous functions on compact metric spaces equipped with a countable dense subset. It is then a natural question what happens if we omit the latter ‘extra data’, i.e., work with ‘unrepresented’ compact metric spaces. In this paper, we study basic third-order statements about continuous functions on such unrepresented compact metric spaces in Kohlenbach’s higher-order Reverse Mathematics. We establish that some (very specific) statements are classified in the (second-order) Big Five of Reverse Mathematics, while most variations/generalisations are not provable from the latter, and much stronger systems. Thus, continuous functions on unrepresented metric spaces are ‘wild’, though ‘more tame’ than (slightly) discontinuous functions on the reals.

Anselm described god as “something than which nothing greater can be thought” [1, p. 93], and Descartes viewed him as “a supreme being” [7, p. 122]. I first capture those characterizations formally in a simple language for monadic predicate logic. Next, I construct a model class inspired by Stoic and medieval doctrines of grades of being [8, 20]. Third, I prove the models sufficient for recovering, as internal mathematics, the famous ontological argument of Anselm, and show that argument to be, on this formalization, valid. Fourth, I extend the models to incorporate a modality fit for proving that any item than which necessarily no greater can be thought is also necessarily real. Lastly, with the present approach, I blunt the sharp edges of notable objections to ontological arguments by Gaunilo and by Grant. A trigger warning: every page of this writing flouts the old saw “Existence is not a predicate” and flagrantly.

Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove Shelah’s $\textsf{ZFC}$ bound on $2^{\aleph _\omega }$. These principles have found many other applications: in cardinal arithmetic and PCF theory; in the construction of combinatorial objects on uncountable cardinals such as Jónsson algebras, strong colourings, Souslin trees, and pathological graphs; to the non-existence of universals in model theory; to the non-existence of forcing axioms at higher uncountable cardinals; and many more.

In this paper, the first part of a series, we survey various forms of club guessing that have appeared in the literature, and then systematically study the various ways in which a club guessing sequence can be improved, especially in the way the frequency of guessing is calibrated.

We include an expository section intended for those unfamiliar with club guessing and which can be read independently of the rest of the article.