Past Logic Seminar

A pseudofinite group is an infinite model of the theory of finite groups. I will discuss what can be said about pseudofinite groups under various tameness assumptions on the theory (e.g. NIP, supersimplicity), structural results on pseudofinite permutation groups, and connections to word maps and generalisations.

In joint work with T. Tsankov we study a (yet other) point at which model theory and dynamics intersect. On the one hand, a (metric) aleph_0-categorical structure is determined, up to bi-interpretability, by its automorphism group, while on the other hand, such automorphism groups are exactly the Roelcke precompact ones. One can further identify formulae on the one hand with Roelcke-continuous functions on the other hand, and similarly stable formulae with WAP functions, providing an easy tool for proving that a group is Roelcke precompact and for calculating its Roelcke/WAP compactification. Model-theoretic techniques, transposed in this manner into the topological realm, allow one to prove further that if R(G) = W(G); then G is totally minimal.

The use of tensed language and the metaphor of set "formation" found in informal descriptions of the iterative conception of set are seldom taken at all seriously. This talk offers an axiomatisation of the iterative conception in a bimodal language and presents some reasons to thus take the tense more seriously than usual (although not literally).

I am interested in integer solutions to equations of the form $f(x)=0$ where $f$ is a transcendental, globally analytic function defined in a neighbourhood of $\infty$ in $\mathbb{R}^n \cup \{\infty\}$. These notions will be defined precisely, and clarified in the wider context of globally semi-analytic and globally subanalytic sets.

The case $n=1$ is trivial (the global assumption forces there to be only finitely many (real) zeros of $f$) and the case $n=2$, which I shall briefly discuss, is completely understood: the number of such integer zeros of modulus at most $H$ is of order $\log\log H$. I shall then go on to consider the situation in higher dimensions.

A major desideratum in transcendental number theory is a simple sufficient condition for a given real number to be irrational, or better yet transcendental. In this talk we consider various forms such a criterion might take, and prove the existence or non-existence of them in various settings.

In {\it Was sind und was sollen die Zahlen?} (1888), Dedekind proves the Recursion Theorem (Theorem 126), and applies it to establish the categoricity of his axioms for arithmetic (Theorem 132). It is essential to these results that mathematical induction is formulated using second-order quantification, and if the second-order quantifier ranges over all subsets of the first-order domain (full second-order quantification), the categoricity result shows that, to within isomorphism, only one structure satisfies these axioms. However, the proof of categoricity is correct for a wide class of non-full Henkin models of second-order quantification. In light of this fact, can the proof of second-order categoricity be taken to establish that the second-order axioms of arithmetic characterize a unique structure?

Ax's theorem on the dimension of the intersection of an algebraic subvariety and a formal subgroup (Theorem 1F in "Some topics in differential algebraic geometry I...") implies Schanuel type transcendence results for a vast class of formal maps (including exp on a semi-abelian variety). Ax stated and proved this theorem in the characteristic 0 case, but the statement is meaningful for arbitrary characteristic and still implies positive characteristic transcendence results. I will discuss my work on positive characteristic version of Ax's theorem.

The transfer principle of Ax-Kochen-Ershov says that every first order sentence φ in the language of valued fields is, for p sufficiently big, true in ℚ_p iff it is true in \F_p((t)). Motivic integration allowed to generalize this to certain kinds of non-first order sentences speaking about functions from the valued field to ℂ. I will present some new transfer principles of this kind and explain how they are useful in representation theory. In particular, local integrability of Harish-Chandra characters, which previously was known only in ℚ_p, can be transferred to \F_p((t)) for p >> 1. (I will explain what this means.)

This is joint work with Raf Cluckers and Julia Gordon.

Sela showed that the theory of the non abelian free groups is stable. In a joint work with Sklinos, we give some characterization of the forking independence relation between elements of the free group F over a set of parameters A in terms of the Grushko and cyclic JSJ decomposition of F relative to A. The cyclic JSJ decomposition of F relative to A is a geometric group theory tool that encodes all the splittings of F as an amalgamated product (or HNN extension) over cyclic subgroups in which A lies in one of the factors.

An externally definable set of a first order structure $M$ is a set of the form $X\cap M^n$ for a set $X$ that is parametrically definable in some elementary extension of $M$. By a theorem of Shelah, these sets form again a first order structure if $M$ is NIP. If $M$ is a real closed field, externally definable sets can be described as some sort of limit sets (to be explained in the talk), in the best case as Hausdorff limits of definable families. It is conjectured that the Shelah structure on a real closed field is generated by expanding the field with convex subsets of the line. This is known to be true in the archimedean case by van den Dries (generalised by Marker and Steinhorn). I will report on recent progress around this question, mainly its confirmation on real closed fields that are close to being maximally valued with archimedean residue field. The main tool is an algebraic characterisation of definable types in real closed valued fields. I also intend to give counterexamples to a localized version of the conjecture. This is joint work with Francoise Delon.

Non-trivial henselian valuations are often so closely related to the arithmetic of the underlying field that they are encoded in it, i.e., that their valuation ring is first-order definable in the language of rings. In this talk, we will give a complete classification of all henselian valued fields of residue characteristic 0 that allow a (0-)definable henselian valuation. This requires new tools from the model theory of ordered abelian groups (joint work with Franziska Jahnke).

The Schelling segregation model has been extensively studied, by researchers in fields as diverse as economics, physics and computer science. While the explicit concern when the model was first introduced back in 1969, was to model the kind for racial segregation observed in large American cities, the model is sufficiently abstract to apply to almost situation in which agents or nodes arrange themselves geographically according to a preference not to be of a minority type within their own neighbourhhood. Kirman and Vinkovik have established, for example, that Schelling's model is a finite difference version of a differential equation describing interparticle forces (and applied in the modelling of cluster formation). Despite the large literature relating to the model, however, it has largely resisted rigorous analysis -- it has not been possible to prove the segregation behaviour easily observed when running simulations. For the first time we have now been able to rigorously analyse the model, and have also established some rather surprising threshold behaviour.

This talk will require no specialist background knowledge.

It has long been a challenge to synthesize the complementary insights offered by model theory and category theory. A small fragment of that challenge is to understand ultraproducts categorically. I will show that, granted some general categorical machinery, the notions of ultrafilter and ultraproduct follow inexorably from the notion of finiteness of a set. The machine in question, known as the codensity monad, has existed in an underexploited state for nearly fifty years. To emphasize that it was not constructed specifically for this purpose, I will mention some of its other applications. This talk represents joint work with an anonymous referee. Little knowledge of category theory will be assumed.

I shall give a non-technical survey of Pure Inductive Logic, a branch of Carnap's Inductive Logic which was

anticipated early on in that subject but has only recently begun to be developed as an area of Mathematical Logic. My intention

is to cover its origins and aims, and to pick out some of the key concepts which have emerged in the last decade or so.

Masser recently proved a bound on the number of rational points of bounded height on the graph of the zeta function restricted to the interval [2,3]. Masser's bound substantially improves on bounds obtained by Bombieri-Pila-Wilkie. I'll discuss some results obtained in joint work with Gareth Boxall in which we prove bounds only slightly weaker than Masser's for several more natural analytic functions.

The study of difference algebraic geometry stems from the efforts of Macintyre and Hrushovski to

count the number of solutions to difference polynomial equations over fields with powers of Frobenius.

We propose a notion of multiplicity in the context of difference algebraic schemes and prove a first principle

of preservation of multiplicity. We shall also discuss how to formulate a suitable intersection theory of difference schemes.

The Outer Model Programme investigates L-like forcing  extensions of the universe, where we say that a model of Set Theory  is L-like if it satisfies properties of Goedel's constructible universe of sets L. I will introduce the Outer Model Programme, talk  about its history, motivations, recent results and applications. I  will be presenting joint work with Sy Friedman and Philipp Luecke.

(Joint work with Nikolaos Galatos.) Proof-theoretic methods provide useful tools for tackling problems for many classes of algebras. In particular, Gentzen systems admitting cut-elimination may be used to establish decidability, complexity, amalgamation, admissibility, and generation results for classes of residuated lattices corresponding to substructural logics. However, for classes of algebras bearing a family resemblance to groups, such methods have so far met only with limited success. The main aim of this talk will be to explain how proof-theoretic methods can be used to obtain new syntactic proofs of two core theorems for the class of lattice-ordered groups: namely, Holland's result that this class is generated as a variety by the lattice-ordered group of order-preserving automorphisms of the real numbers, and the decidability of the word problem for free lattice-ordered groups.

(Joint work with Artem Chernikov.) In the talk, we will first recall some basic results on valued difference fields, both from an algebraic and from a model-theoretic point of view. In particular, we will give a description, due to Hrushovski, of the theory VFA of the non-standard Frobenius acting on an algebraically closed valued field of residue characteristic 0, as well as an Ax-Kochen-Ershov type result for certain valued difference fields which was proved by Durhan. We will then present a recent work where it is shown that VFA does not have the tree property of the second kind (i.e., is NTP2); more generally, in the context of the Ax-Kochen-Ershov principle mentioned above, the valued difference field is NTP2 iff both the residue difference field and the value difference group are NTP2. The property NTP2 had already been introduced by Shelah in 1980, but only recently it has been shown to provide a fruitful ‘tameness’ assumption, e.g. when dealing with independence notions in unstable NIP theories (work of Chernikov-Kaplan).