Skip to main content

Home

The Leeds Logic group

Mathematical logic, a young subject, has developed over the last 30 years into an amalgam of fast-moving disciplines, each with its own sophisticated techniques. These are linked by profound common concerns, around definability, decidability, effectiveness and computability, the nature of the continuum, and foundations. Some branches are highly multidisciplinary and force the researcher to be fully conversant with other fields (e.g. algebra, computer science).

The Logic Group at the University of Leeds is one of the largest and most active worldwide, with a long uninterrupted tradition dating back to 1951, when its founder Martin Löb moved to Leeds. It has an international reputation for research in most of the main areas of mathematical logic - computability theory, model theory, set theory, proof theory, and in applications to algebra, analysis, number theory and theoretical computer science.

More details about the current grants, PhD students, and research interests are on our Research page.

Upcoming events

Floris Vermeulen (KU Leuven)

Location: MALL
Title: Parametrizations in valued fields

In the o-minimal setting, parametrizations of definable sets form a key component of the Pila-Wilkie counting theorem. A similar strategy based on parametrizations was developed by Cluckers-Comte-Loeser and Cluckers-Forey-Loeser to prove an analogue of the Pila-Wilkie theorem for subanalytic sets in $p$-adic fields. In ongoing work with R. Cluckers, P. Cubides-K. and I. Halupczok, we prove the existence of parametrizations for arbitrary definable sets in Hensel minimal fields, leading to a counting theorem in this general context.

Emanuele Frittaion (University of Leeds)

Location: MALL
Title: Peano arithmetic, games, and descent recursion

I will discuss a game semantics for classical (first-order) arithmetic due to Coquand. The real content of this semantics is a proof of cut elimination for infinitary propositional logic. As the title suggests, I will say something about descent recursive functions and how it all comes together.

Greg Restall (University of St Andrews)

Location: MALL

View all Events