NSOP1 is a class of first order theories containing simple theories, which contains many natural examples that somehow slip-out of the simple context.

As in simple theories, NSOP1 theories admit a natural notion of independence dubbed Kim-independence, which generalizes non-forking in simple theories and satisfies many of its properties.

In this talk I will explain all these notions, and in particular talk about recent progress (joint with Nick Ramsey) in the study of Kim-independence, showing transitivity and several consequences.

Here Z is Zermelo’s set theory of 1908, as later formulated: full separation, but no replacement or collection among its axioms. PROVI was presented in lectures in Cambridge in 2010 and later published with improvements by Nathan Bowler, and is, I claim, the weakest subsystem of ZF to support a recognisable theory of set forcing: PROV is PROVI shorn of its axiom of infinity. The provident sets are the transitive non-empty models of PROV. The talk will begin with a presentation of PROV, and then discuss more recent applications and problems: in particular an answer in the system Z + PROV to a question posed by Eugene Wesley in 1972 will be sketched, and two proofs (fallacious, I hope) of 0 = 1 will be given, one using my slim models of Z and the other applying the Spector–Gandy theorem to certain models of PROVI. These “proofs”, when re-interpreted, supply some arguments of Reverse Mathematics.

Starting with a countable transitive model of V=L, we show that by 
adding a single Cohen real, c, most intermediate models do no satisfy choice. In 
fact, most intermediate models to L[c] are not even definable.

The key part of the proof is the Bristol model, which is intermediate to L[c], 
but is not constructible from a set. We will give a broad explanation of the 
construction of the Bristol model within the constraints of time.

 The talk is about the normal modal logics of elementary classes defined by first-order formulas of the form
 'for all x_0 there exist x_1, ..., x_n phi(x_0, x_1, ... x_n)' with phi being a conjunction of binary atoms.
 I'll show that many properties of these logics, such as finite axiomatisability,
 elementarity,  axiomatisability by a set of canonical formulas or by a single generalised Sahlqvist formula,
 together with modal definability of the initial formula, either simultaneously hold or simultaneously do not hold.
 

Polynomials have been at the heart of mathematics for a millennium, yet when it comes to applying them, there are many puzzles and surprises. Among others, our tour will visit Newton, Lagrange, Gauss, Galois, Runge, Bernstein, Clenshaw and Chebfun (with a computer demo).

How do humans process information? What are their strengths and limitations? This crash course in cognitive psychology will provide the background necessary to think realistically about how learning works.

Mathematicians need to talk and writeabout their mathematics.  This includes undergraduates and MSc students, who may be writing a dissertation or project report, preparing a presentation on a summer research project, or preparing for a job interview.  We think that it can be helpful to think of this as a form of story telling, as this can lead to more effective communication.  For a story to be engaging you also need to know your audience.In this session, we'll discuss what we mean by telling a mathematical story, give you some top tips from our experience, and give you a chance to think about how you might put this into practice.  The session will be of relevance to all undergraduates and MSc students, not only those currently writing a dissertation or preparing an oral presentation.