Skip to main content

Events

Archive: all, 2023, 2022, 2021, 2020

Search results for “”

Results 1 to 10 of 152

Andrew Brooke-Taylor (University of Leeds)

Date
, 1.00 PM
Category

Location: Roger Stevens LT 04 (8.04)
Title: "Categorifying" Borel reducibility
NOTE: this is a 2-hour seminar for both model and set theorists.

Please make note of the unusual venue!

Borel reducibility is a framework for comparing the complexities of different equivalence relations, and it has been used to great effect showing that various old classification programmes were impossible tasks. However, these days classification maps are generally expected to be functorial, which the classical Borel reducibility framework takes no account of. After going through preliminaries of the classical set-up, I will present a natural framework of Borel categories and functorial Borel reducibility that remedies this oversight. Notably, many examples of classes of structures that were known to be universal in a Borel reducibility sense - Borel complete - are not universal for our functorial version. I'll give many examples, including new ones for the old hands who've seen me talk about this stuff before. This is joint work with Filippo Calderoni.

Dan Marsden (University of Nottingham)

Date
, 4.00 PM
Category

Location: Roger Stevens LT 13 (10.13)
Title: Games, Comonads and Compositionality
NOTE location change: Roger Stevens LT 13 (10.13)

Recent work of Abramsky, Dawar and Wang, and subsequently Abramsky and Shah, provided a categorical abstraction of model comparison games such as the Ehrenfeucht-Fraïssé, pebble and bisimulation games, in the form of so-called game comonads. This work opened up new connections between disciplines associated with computational power and complexity such as finite model theory and combinatorics, and areas traditionally focussed upon the structural understanding of computation and logic, such as program semantics.

This talk will introduce the comonadic perspective upon model comparison games. I shall then describe more recent work, jointly with Tomáš Jakl and Nihil Shah, giving a categorical account of Feferman-Vaught-Mostowski type theorems with this categorical framework.

The talk will aim to be reasonably self-contained, assuming only a basic background in logic, and some understanding of the categorical notions of category, functor and natural transformation.

Aris Papadopoulos (University of Leeds)

Date
, 1.00 PM
Category

Location: MALL
Title: Zarankiewicz’s Problem and Model Theory
NOTE: this is a 2-hour seminar for both model and set theorists.

A shower thought that anyone interested in graph theory must have had at some point in their lives is the following: `How “sparse" must a given graph be, if I know that it has no “dense” subgraphs?’. This curiosity definitely crossed the mind of Polish mathematician K. Zarankiewicz, who asked a version of this question formally in 1951. In the years that followed, many central figures in the development of extremal combinatorics contemplated this problem, giving various kinds of answers. Some of these will be surveyed in the first part of my talk.

So far so good, but this is a model (and set) theory seminar and the title does include the words “Model Theory"… In the second part of my talk, I will discuss how the celebrated Szemerédi-Trotter theorem gave a starting point to the study of Zarankiewicz’s problem in “geometric” contexts, and how the language of model theory has been able to capture exactly what these contexts are. I will then ramble about improvements to the classical answers to Zarankiewicz’s problem when we restrict our attention to one of: (a) semilinear/semibounded o-minimal structures; (b) Presburger arithmetic, and (c) various kinds of Hrushovski constructions. The second hour of the talk will essentially be devoted to proofs. Which of (a),(b), or (c) will occupy the second hour will depend on input from the audience.

The new results appearing in the talk were obtained jointly with Pantelis Eleftheriou.

Pablo Andujar Guerrero (University of Leeds)

Date
, 2.00 PM
Category

Location: MALL
Title: Defining definable compactness
 

Can topological compactness be expressed as a first-order property within tame topology? Let's find out. In this talk I will present various attempts in the literature to capture this notion. We will go over the model theory behind them and present open questions.

Calliope Ryan-Smith (University of Leeds)

Date
, 1.00 PM
Category

Location: MALL
Title: Finality of forcing
 

Iterated forcing is a powerful tool for ouroboric arguments in set theory that rely on repeatedly creating or destroying some property until your construction eats its own tail and gives you your final result (in fact a similar argument may be applied to many ideas in set theory, especially when ordinals are involved. A simple example would be the \omega_1th stage of the Borel/projective hierarchies being no more than the union of their prior stages). To this end, it is often a helpful feature of an iterated notion of forcing that in the final model one has not introduced any new reals (subsets of \kappa, functions \lambda\to\lambda, etc) that are not already present in some intermediate stage. This behaviour is precisely captured by finality, which we shall define and give an exact characterisation of.

Dugald Macpherson (Leeds)

Date
, 4.00 PM
Category

Location: MALL
Title: Definable groups in valued fields

I will discuss joint work with Gismatullin and Halupczok, giving the structure of definably (almost) simple groups definable in Henselian valued fields, possibly equipped with extra structure. I will also describe some other work on definable groups in valued fields.

Dugald Macpherson (Leeds)

Date
, 2.00 PM
Category

Location: MALL
Title: Omega-categorical pseudofinite groups
 

I will discuss recent joint work with Katrin Tent on omega-categorical groups which are pseudofinite, i.e. satisfy every first order  sentence which is true of all finite groups. It is fairly easy to show that they are nilpotent-by-finite, and we conjecture that they are finite-by-abelian-by-finite, and can reduce this to the nilpotent class 2 case. We show that  certain class 2 groups constructed by amalgamation are NOT pseudofinite – in particular there is an example with supersimple theory which is not pseudofinite.

Vera Fischer (Universität Wien)

Date
, 1.00 PM
Category

Location: MALL
Title: Eventually different, refining and dominating families at the uncountable
NOTE: the speaker will be joining us online.

We will discuss some recent results, including ZFC inequalities, concerning the higher Baire spaces analogues of some of the classical combinatorial cardinal characteristics of the continuum.

Of special interest for the talk will be the generalized bounding number, relatives of the generalized almost disjointness number, as well as the generalized refining and dominating numbers.

Ben De Smet (Leeds)

Date
, 2.00 PM
Category

Location: MALL
Title: The Whitney embedding theorems and o-minimality
 

The Whitney embedding theorems (95%) and o-minimality (5%).

Jiachen Yuan (Leeds)

Date
, 1.00 PM
Category

Location: MALL
Title: Weak Threads for Ladder Systems at Inaccessible $\kappa$
 

"Every club sequence has a weak thread" is a compactness property that implies simutaneously stationary reflection. In this talk, we will first explore weak threads for various ladder systems. Then we show it is consistent that every club sequence has a weak thread and there exists an almost disjoint ladder system given by vanishing branches of a $\kappa$-Suslin tree. This is joint work with Assaf Rinot and Zhixing You.