We study universal-existential fragments of first-order theories of fields, in particular of function fields and of equicharacteristic henselian valued fields. For example, we discuss to what extent the theory of a field k determines the universal-existential theories of the rational function field over k and of the field of Laurent series over k, and we find various many-one reductions between such fragments.

Dedicated to the memory of Alexander Prestel (1941–2024)

We prove that the structure $(\mathbb {Z},<,+,R)$ is distal for all congruence-periodic sparse predicates $R\subseteq \mathbb {N}$. We do so by constructing a strong honest definition for every formula $\phi (x;y)$ with $\lvert {x}\rvert =1$, providing a rare example of concrete distal decompositions.

We show, assuming PD, that every complete finitely axiomatized second-order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second-order theory with a countable model which is non-categorical. We show that the existence of even very large (e.g., supercompact) cardinals does not imply the categoricity of all finitely axiomatizable complete second-order theories. More exactly, we show that a non-categorical complete finitely axiomatized second-order theory can always be obtained by (set) forcing. We also show that the categoricity of all finite complete second-order theories with a model of a certain singular cardinality $\kappa $ of uncountable cofinality can be forced over any model of set theory. Previously, Solovay had proved, assuming $V=L$, that every complete finitely axiomatized second-order theory (with or without a countable model) is categorical, and that in a generic extension of L there is a complete finitely axiomatized second-order theory with a countable model which is non-categorical.

Let $\mathsf {KP}$ denote Kripke–Platek Set Theory and let $\mathsf {M}$ be the weak set theory obtained from $\mathsf {ZF}$ by removing the collection scheme, restricting separation to $\Delta _0$-formulae and adding an axiom asserting that every set is contained in a transitive set ($\mathsf {TCo}$). A result due to Kaufmann [9] shows that every countable model, $\mathcal {M}$, of $\mathsf {KP}+\Pi _n\textsf {-Collection}$ has a proper $\Sigma _{n+1}$-elementary end extension. We show that for all $n \geq 1$, there exists an $L_\alpha $ (where $L_\alpha $ is the $\alpha ^{\textrm {th}}$ approximation of the constructible universe L) that satisfies $\textsf {Separation}$, $\textsf {Powerset}$ and $\Pi _n\textsf {-Collection}$, but that has no $\Sigma _{n+1}$-elementary end extension satisfying either $\Pi _n\textsf {-Collection}$ or $\Pi _{n+3}\textsf {-Foundation}$. Thus showing that there are limits to the amount of the theory of $\mathcal {M}$ that can be transferred to the end extensions that are guaranteed by Kaufmann’s theorem. Using admissible covers and the Barwise Compactness theorem, we show that if $\mathcal {M}$ is a countable model $\mathsf {KP}+\Pi _n\textsf {-Collection}+\Sigma _{n+1}\textsf {-Foundation}$ and T is a recursive theory that holds in $\mathcal {M}$, then there exists a proper $\Sigma _n$-elementary end extension of $\mathcal {M}$ that satisfies T. We use this result to show that the theory $\mathsf {M}+\Pi _n\textsf {-Collection}+\Pi _{n+1}\textsf {-Foundation}$ proves $\Sigma _{n+1}\textsf {-Separation}$.

We expand the study of generic stability in three different directions. Generic stability is best understood as a property of types in $NIP$ theories in classical logic. In this article, we make attempts to generalize our understanding to Keisler measures instead of types, arbitrary theories instead of $NIP$ theories, and continuous logic instead of classical logic. For this purpose, we study randomization of first-order structures/theories and modes of convergence of types/measures.

Let $\mathcal {M}=(M,<,+, \dots )$ be a weakly o-minimal non-valuational structure expanding an ordered group. We show that the full first-order theory $\operatorname {\mathrm {Th}}(\mathcal {M})$ has definable Skolem functions if and only if isolated types in $S_{n}^{\mathcal M}(A)$ are dense for each $ A\subseteq M $ and $ n\in \mathbb {N} $. Using this, we prove that no strictly weakly o-minimal non-valuational expansion of an ordered group has definable Skolem functions, thereby answering Conjecture 1.7 of Eleftheriou et al. (On definable Skolem functions in weakly o-minimal non-valuational structures. J. Symb. Logic, vol. 82 (2017), no. 4).

We study mixed identities for oligomorphic automorphism groups of countable relational structures. Our main result gives sufficient conditions for such a group to not admit a mixed identity without particular constants. We study numerous examples and prove in many cases that there cannot be a non-singular mixed identity.

We study dependence and independence concepts found in quantum physics, especially those related to hidden variables and non-locality, through the lens of team semantics and probabilistic team semantics, adapting a relational framework introduced in [1]. This also leads to new developments in independence logic and probabilistic independence logic.

We study the Lyndon interpolation property (LIP) and the uniform LIP (ULIP) for extensions of $\mathbf {S4}$ and intermediate propositional logics. We prove that among the 18 consistent normal modal logics of finite height extending $\mathbf {S4}$ known to have CIP, 11 logics have LIP and 7 logics do not. We also prove that for intermediate propositional logics, the Craig interpolation property, LIP, and ULIP are equivalent.

For each $n\geq 1$, let $FT_n$ be the free tree monoid of rank n and $E_n$ the full extensive transformation monoid over the finite chain $\{1, 2, \ldots , n\}$. It is shown that the monoids $FT_n$ and $E_{n+1}$ satisfy the same identities. Therefore, $FT_n$ is finitely based if and only if $n\leq 3$.

Answering a question of Kaye, we show that the compositional truth theory with the full collection scheme is conservative over Peano Arithmetic. We demonstrate it by showing that countable models of compositional truth which satisfy the internal induction or collection axioms can be end-extended to models of the respective theory.

This paper shows how to set up Fine’s “theory-application” type semantics so as to model the use-unrestricted “Official” consequence relation for a range of relevant logics. The frame condition matching the axiom $(((A \to A) \land (B \to B)) \to C) \to C$—the characteristic axiom of the very first axiomatization of the relevant logic E—is shown forth. It is also shown how to model propositional constants within the semantic framework. Whereas the related Routley–Meyer type frame semantics fails to be strongly complete with regards to certain contractionless logics such as B, the current paper shows that Fine’s weak soundness and completeness result can be extended to a strong one also for logics like B.

We study infinite groups interpretable in power bounded T-convex, V-minimal or p-adically closed fields. We show that if G is an interpretable definably semisimple group (i.e., has no definable infinite normal abelian subgroups) then, up to a finite index subgroup, it is definably isogenous to a group $G_1\times G_2$, where $G_1$ is a K-linear group and $G_2$ is a $\mathbf {k}$-linear group. The analysis is carried out by studying the interaction of G with four distinguished sorts: the valued field K, the residue field $\mathbf {k}$, the value group $\Gamma $, and the closed $0$-balls $K/\mathcal {O}$.

We investigate the primitive recursive content of linear orders. We prove that the punctual degrees of rigid linear orders, the order of the integers $\mathbb {Z}$, and the order of the rationals $\mathbb {Q}$ embed the diamond (preserving supremum and infimum). In the cases of rigid orders and the order $\mathbb {Z}$, we further extend the result to embed the atomless Boolean algebra; we leave the case of $\mathbb {Q}$ as an open problem. We also show that our results for the rigid orders, in fact, work for orders having a computable infinite invariant rigid sub-order.

We prove the existence of a model companion of the two-sorted theory of c-nilpotent Lie algebras over a field satisfying a given theory of fields. We describe a language in which it admits relative quantifier elimination up to the field sort. Using a new criterion which does not rely on a stationary independence relation, we prove that if the field is NSOP$_1$, then the model companion is NSOP$_4$. We also prove that if the field is algebraically closed, then the model companion is c-NIP.

We provide a complete characterization of theories of tracial von Neumann algebras that admit quantifier elimination. We also show that the theory of a separable tracial von Neumann algebra $\mathcal {M}$ is never model complete if its direct integral decomposition contains $\mathrm {II}_1$ factors $\mathcal {N}$ such that $M_2(\mathcal {N})$ embeds into an ultrapower of $\mathcal {N}$. The proof in the case of $\mathrm {II}_1$ factors uses an explicit construction based on random matrices and quantum expanders.

An étale structure over a topological space X is a continuous family of structures (in some first-order language) indexed over X. We give an exposition of this fundamental concept from sheaf theory and its relevance to countable model theory and invariant descriptive set theory. We show that many classical aspects of spaces of countable models can be naturally framed and generalized in the context of étale structures, including the Lopez-Escobar theorem on invariant Borel sets, an omitting types theorem, and various characterizations of Scott rank. We also present and prove the countable version of the Joyal–Tierney representation theorem, which states that the isomorphism groupoid of an étale structure determines its theory up to bi-interpretability; and we explain how special cases of this theorem recover several recent results in the literature on groupoids of models and functors between them.

We prove an analog of the disintegration theorem for tracial von Neumann algebras in the setting of elementary equivalence rather than isomorphism, showing that elementary equivalence of two direct integrals of tracial factors implies fiberwise elementary equivalence under mild, and necessary, hypotheses. This verifies a conjecture of Farah and Ghasemi. Our argument uses a continuous analog of ultraproducts where an ultrafilter on a discrete index set is replaced by a character on a commutative von Neumann algebra, which is closely related to Keisler randomizations of metric structures. We extend several essential results on ultraproducts, such as Łoś’s theorem and countable saturation, to this more general setting.

In the classification of complete first-order theories, many dividing lines have been defined in order to understand the complexity and the behavior of some classes of theories. In this paper, using the concept of patterns of consistency and inconsistency, we describe a general framework to study dividing lines and introduce a notion of maximal complexity by requesting the presence of all the exhibitable patterns of definable sets. Weakening this notion, we define new properties (Positive Maximality and the $\mathrm {PM}^{(k)}$ hierarchy) and prove some results about them. In particular, we show that $\mathrm {PM}^{(k+1)}$ theories are not k-dependent. Moreover, we provide an example of a $\mathrm {PM}$ but $\mathrm {NSOP}_4$ theory (showing that $\mathrm {SOP}$ and the $\mathrm {SOP}_n$ hierarchy, for $n \geq 4$, cannot be described by positive patterns) and, for each $1<k<\omega $, an example of a $\mathrm {PM}^{(k)}$ but $\mathrm {NPM}^{(k+1)}$ theory (showing that the newly defined hierarchy does not collapse).

We give a unified overview of the study of the effects of additional set theoretic axioms on quotient structures. Our focus is on rigidity, measured in terms of existence (or rather non-existence) of suitably non-trivial automorphisms of the quotients in question. A textbook example for the study of this topic is the Boolean algebra $\mathcal {P}({\mathbb N})/\operatorname {\mathrm {Fin}}$, whose behavior is the template around which this survey revolves: Forcing axioms imply that all of its automorphisms are trivial, in the sense that they are induced by almost permutations of ${\mathbb N}$, while under the Continuum Hypothesis this rigidity fails and $\mathcal {P}({\mathbb N})/\operatorname {\mathrm {Fin}}$ admits uncountably many non-trivial automorphisms. We consider far-reaching generalisations of this phenomenon and present a wide variety of situations where analogous patterns persist, focusing mainly (but not exclusively) on the categories of Boolean algebras, Čech–Stone remainders, and $\mathrm {C}^{*}$-algebras. We survey the state of the art and the future prospects of this field, discussing the major open problems and outlining the main ideas of the proofs whenever possible.