# Past Logic Seminar

7 November 2013
17:15
Dan Isaacson
Abstract
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?
• Logic Seminar
31 October 2013
17:15
Piotr Kowalski
Abstract
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.
• Logic Seminar
24 October 2013
17:15
Immanuel Halupczok
Abstract
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.
• Logic Seminar
17 October 2013
17:15
Jochen Koenigsmann
Abstract
<div>We give a negative answer to Abraham Robinson's question whether a finitely generated extension of an undecidable field is always undecidable by constructing undecidable fields of transcendence degree 1 over the rationals all of whose proper finite extensions are decidable. We also construct undecidable algebraic extensions of the rationals which allow decidable finite extensions.</div>
• Logic Seminar
13 June 2013
17:00
Chloe Perin
Abstract
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.
• Logic Seminar
6 June 2013
17:00
Marcus Tressl
Abstract
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.
• Logic Seminar
30 May 2013
17:00
Jochen Koenigsmann
Abstract
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).
• Logic Seminar
23 May 2013
17:00
Andrew Lewis
Abstract
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.
• Logic Seminar
16 May 2013
17:00
Tom Leinster
Abstract
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.
• Logic Seminar
9 May 2013
17:00
Dan Isaacson
Abstract
• Logic Seminar