Clans are categorical representations of generalized algebraic theories that contain more information than the finite-limit categories associated to the locally finitely presentable categories of models via Gabriel–Ulmer duality. Extending Gabriel–Ulmer duality to account for this additional information, we present a duality theory between clans and locally finitely presentable categories equipped with a weak factorization system of a certain kind.

We prove that the class of separably algebraically closed valued fields equipped with a distinguished Frobenius endomorphism $x \mapsto x^q$ is decidable, uniformly in q. The result is a simultaneous generalization of the work of Chatzidakis and Hrushovski (in the case of the trivial valuation) and the work of the first author and Hrushovski (in the case where the fields are algebraically closed).

The logical setting for the proof is a model completeness result for valued fields equipped with an endomorphism $\sigma $ which is locally infinitely contracting and fails to be onto. Namely, we prove the existence of a model complete theory $\widetilde {\mathrm {VFE}}$ amalgamating the theories $\mathrm {SCFE}$ and $\widetilde {\mathrm {VFA}}$ introduced in [5] and [11], respectively. In characteristic zero, we also prove that $\widetilde {\mathrm {VFE}}$ is NTP$_2$ and classify the stationary types: they are precisely those orthogonal to the fixed field and the value group.

Using motivic integration theory and the notion of riso-triviality, we introduce two new objects in the framework of definable nonarchimedean geometry: a convenient partial preorder $\preccurlyeq$ on the set of constructible motivic functions, and an invariant $V_0$, nonarchimedean substitute for the number of connected components. We then give several applications based on $\preccurlyeq$ and $V_0$: we obtain the existence of nonarchimedean substitutes of real measure geometric invariants $V_i$, called the Vitushkin variations, and we establish the nonarchimedean counterpart of a real inequality involving $\preccurlyeq$, the metric entropy and our invariants $V_i$. We also prove the nonarchimedean Cauchy–Crofton formula for definable sets of dimension $d$, relating $V_0$ (and $V_d$) and the motivic measure in dimension $d$.

We present a counterexample to [Kan08, Conjecture 14.1.6], regarding Borel equivalence relations on product spaces.

A first-order expansion of $(\mathbb {R},+,<)$ is dp-minimal if and only if it is o-minimal. We prove analogous results for algebraic closures of finite fields, p-adic fields, ordered abelian groups with only finitely many convex subgroups (in particular archimedean ordered abelian groups), and abelian groups equipped with archimedean cyclic group orders. The latter allows us to describe unary definable sets in dp-minimal expansions of $(\mathbb {Z},+,S)$, where S is a cyclic group order. Along the way we describe unary definable sets in dp-minimal expansions of ordered abelian groups. In the last section we give a canonical correspondence between dp-minimal expansions of $(\mathbb {Q},+,<)$ and o-minimal expansions ${\mathscr R}$ of $(\mathbb {R},+,<)$ such that $({\mathscr R},\mathbb {Q})$ is a “dense pair.”.

It is shown that if $\{H_n\}_{n \in \omega}$ is a sequence of groups without involutions, with $1 \lt |H_n| \leq 2^{\aleph_0}$, then the topologist’s product modulo the finite words is (up to isomorphism) independent of the choice of sequence. This contrasts with the abelian setting: if $\{A_n\}_{n \in \omega}$ is a sequence of countably infinite torsion-free abelian groups, then the isomorphism class of the product modulo sum $\prod_{n \in \omega} A_n/\bigoplus_{n \in \omega} A_n$ is dependent on the sequence.

We examine topological pairs $(A,B)$ which have computable type, which means that the following holds: if X is a computable topological space and $f:A\rightarrow X$ is an embedding such that $f(A)$ and $f(B)$ are semicomputable sets in X, then $f(A)$ is a computable set in X. If $(A,\emptyset )$ has computable type, we say that A has computable type. In general, if a topological pair $(A,B)$ is such that the quotient space $A/B$ has computable type, then $(A,B)$ need not have computable type. We prove the following: if $A/B$ has computable type and the interior of B in A is empty, then $(A,B)$ has computable type. On the other hand, if $(A,B)$ has computable type, then $A/B$ need not have computable type even if $\mathop {\mathrm {Int}}_{A}B=\emptyset $. Related to this, we introduce the notion of a local computable type. We show that $\mathbb {R}^{n} /K$ has local computable type if K is a compact subspace of $\mathbb {R}^{n} $ such that $\mathbb {R}^{n} \setminus K$ has finitely many connected components.

We produce, relative to a $\textsf {ZFC}$ model with a supercompact cardinal, a $\textsf {ZFC}$ model of the Proper Forcing Axiom in which the nonstationary ideal on $\omega _1$ is $\Pi _1$-definable in a parameter from $H_{\aleph _2}$.

In this paper, a proof-theoretic perspective on counterfactual inference is proposed. On this perspective, proof-theoretic structure is fundamental. We start from a certain primacy of inferential practice and structural proof theory. Models are required neither for the explanation of the meaning of counterfactuals, nor for that of counterfactual inference. Taking a proof-theoretic perspective and an intuitionistic stance on meaning (cf. BHK), we define modal intuitionistic natural deduction systems for drawing conclusions from counterfactual assumptions. These proof systems are modal insofar as derivations in them make use of assumption modes which are sensitive to the factuality status (e.g., factual, counterfactual) of the formula that is to be assumed. This status is determined by a reference proof system on top of which a modal proof system is defined. The rules of a modal system draw on this status.

The main results obtained are preservation, normalization, subexpression (incl. subformula) property, and internal completeness. The systems are applied to the analysis of reasoning with natural language constructions such as ‘If A were the case, B would [might] be the case’, ‘Since A is the case, B is [might be] the case’. A proof-theoretic semantics is provided for them.

Pre-H-fields are ordered valued differential fields satisfying some basic axioms coming from transseries and Hardy fields. We study pre-H-fields that are differential-Hensel–Liouville closed, that is, differential-henselian, real closed, and closed under exponential integration, establishing an Ax–Kochen/Ershov theorem for such structures: the theory of a differential-Hensel–Liouville closed pre-H-field is determined by the theory of its ordered differential residue field; this result fails if the assumption of closure under exponential integration is dropped. In a two-sorted setting with one sort for a differential-Hensel–Liouville closed pre-H-field and one sort for its ordered differential residue field, we eliminate quantifiers from the pre-H-field sort, from which we deduce that the ordered differential residue field is purely stably embedded and if it has NIP, then so does the two-sorted structure. Similarly, the one-sorted theory of differential-Hensel–Liouville closed pre-H-fields with closed ordered differential residue field has quantifier elimination, is the model completion of the theory of pre-H-fields with gap $0$, and is complete, distal, and locally o-minimal.

We define several notions of a limit point on sequences with domain a barrier in $[\omega ]^{<\omega }$ focusing on the two dimensional case $[\omega ]^2$. By exploring some natural candidates, we show that countable compactness has a number of generalizations in terms of limits of high dimensional sequences and define a particular notion of $\alpha $-countable compactness for $\alpha \leq \omega _1$. We then focus on dimension 2 and compare 2-countable compactness with notions previously studied in the literature. We present a number of counterexamples showing that these classes are different. In particular assuming the existence of a Ramsey ultrafilter, a subspace of $\beta \omega $ which is doubly countably compact whose square is not countably compact, answering a question of T. Banakh, S. Dimitrova, and O. Gutik [3]. The analysis of this construction leads to some possibly new types of ultrafilters related to discrete, P-points and Ramsey ultrafilters.

It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles on $\mathbb {R}^2$ does not.

Building on our previous work on enriched universal algebra, we define a notion of enriched language consisting of function and relation symbols whose arities are objects of the base of enrichment $\mathcal {V}$. In this context, we construct atomic formulas and define the regular fragment of our enriched logic by taking conjunctions and existential quantification of those. We then characterize $\mathcal {V}$-categories of models of regular theories as enriched injectivity classes in the $\mathcal {V}$-category of structures. These notions rely on the choice of an orthogonal factorization system $(\mathcal {E},\mathcal {M})$ on $\mathcal {V}$ which will be used, in particular, to interpret relation symbols and existential quantification.

We study the descriptive complexity of sets of points defined by restricting the statistical behaviour of their orbits in dynamical systems on Polish spaces. Particular examples of such sets are the sets of generic points of invariant Borel probability measures, but we also consider much more general sets (for example, $\alpha $-Birkhoff regular sets and the irregular set appearing in the multifractal analysis of ergodic averages of a continuous real-valued function). We show that many of these sets are Borel in general, and all these are Borel when we assume that our space is compact. We provide examples of these sets being non-Borel, properly placed at the first level of the projective hierarchy (they are complete analytic or co-analytic). This proves that the compactness assumption is, in some cases, necessary to obtain Borelness. When these sets are Borel, we measure their descriptive complexity using the Borel hierarchy. We show that the sets of interest are located at most at the third level of the hierarchy. We also use a modified version of the specification property to show that these sets are properly located at the third level of the hierarchy for many dynamical systems. To demonstrate that the specification property is a sufficient, but not necessary, condition for maximal descriptive complexity of a set of generic points, we provide an example of a compact minimal system with an invariant measure whose set of generic points is $\boldsymbol {\Pi }^0_3$-complete.

We present a family of minimal modal logics (namely, modal logics based on minimal propositional logic) corresponding each to a different classical modal logic. The minimal modal logics are defined based on their classical counterparts in two distinct ways: (1) via embedding into fusions of classical modal logics through a natural extension of the Gödel–Johansson translation of minimal logic into modal logic S4; (2) via extension to modal logics of the multi- vs. single-succedent correspondence of sequent calculi for classical and minimal logic. We show that, despite being mutually independent, the two methods turn out to be equivalent for a wide class of modal systems. Moreover, we compare the resulting minimal version of K with the constructive modal logic CK studied in the literature, displaying tight relations among the two systems. Based on these relations, we also define a constructive correspondent for each minimal system, thus obtaining a family of constructive modal logics which includes CK as well as other constructive modal logics studied in the literature.

We prove several results showing that every locally finite Borel graph whose large-scale geometry is ‘tree-like’ induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has bounded tree-width or is quasi-isometric to a tree, answering a question of Tucker-Drob. In the latter case, we moreover show that there exists a Borel quasi-isometry to a Borel forest, under the additional assumption of (componentwise) bounded degree. We also extend these results on quasi-treeings to Borel proper metric spaces. In fact, our most general result shows treeability of countable Borel equivalence relations equipped with an abstract wallspace structure on each class obeying some local finiteness conditions, which we call a proper walling. The proof is based on the Stone duality between proper wallings and median graphs (i.e., CAT(0) cube complexes). Finally, we strengthen the conclusion of treeability in these results to hyperfiniteness in the case where the original graph has one (selected) end per component, generalizing the same result for trees due to Dougherty–Jackson–Kechris.

We prove that there exists a left-c.e. Polish space not homeomorphic to any right-c.e. space. Combined with some other recent works (to be cited), this finishes the task of comparing all classical notions of effective presentability of Polish spaces that frequently occur in the literature up to homeomorphism.

We employ our techniques to provide a new, relatively straightforward construction of a computable Polish space K not homeomorphic to any computably compact space. We also show that the Banach space $C(K;\mathbb {R})$ has a computable Banach copy; this gives a negative answer to a question raised by McNicholl.

We also give an example of a space that has both a left-c.e. and a right-c.e. presentation, yet it is not homeomorphic to any computable Polish space. In addition, we provide an example of a $\Delta ^0_2$ Polish space that lacks both a left-c.e. and a right-c.e. copy, up to homeomorphism.

In a paper from 1980, Shelah constructed an uncountable group all of whose proper subgroups are countable. Assuming the continuum hypothesis, he constructed an uncountable group G that moreover admits an integer n satisfying that for every uncountable $X\subseteq G$, every element of G may be written as a group word of length n in the elements of X. The former is called a Jónsson group, and the latter is called a Shelah group.

In this paper, we construct a Shelah group on the grounds of $\textsf {{ZFC}}$ alone – that is, without assuming the continuum hypothesis. More generally, we identify a combinatorial condition (coming from the theories of negative square-bracket partition relations and strongly unbounded subadditive maps) sufficient for the construction of a Shelah group of size $\kappa $, and we prove that the condition holds true for all successors of regular cardinals (such as $\kappa =\aleph _1,\aleph _2,\aleph _3,\ldots $). This also yields the first consistent example of a Shelah group of size a limit cardinal.

In this paper we first consider hyperfinite Borel equivalence relations with a pair of Borel $\mathbb {Z}$-orderings. We define a notion of compatibility between such pairs, and prove a dichotomy theorem which characterizes exactly when a pair of Borel $\mathbb {Z}$-orderings are compatible with each other. We show that, if a pair of Borel $\mathbb {Z}$-orderings are incompatible, then a canonical incompatible pair of Borel $\mathbb {Z}$-orderings of $E_0$ can be Borel embedded into the given pair. We then consider hyperfinite-over-finite equivalence relations, which are countable Borel equivalence relations admitting Borel $\mathbb {Z}^2$-orderings. We show that if a hyperfinite-over-hyperfinite equivalence relation E admits a Borel $\mathbb {Z}^2$-ordering which is self-compatible, then E is hyperfinite.

We prove that any compact R-analytic group is linear when R is a pro-p domain of characteristic zero.