Logic Seminar

The problem of integration in finite terms is the problem of finding exact closed forms for antiderivatives of functions, within a given class of functions. Liouville introduced his elementary functions (built from polynomials, exponentials, logarithms and trigonometric functions) and gave a solution to the problem for that class, nearly 200 years ago. The same problem was shown to be decidable and an algorithm given by Risch in 1969.

We introduce the class of exponentially-algebraic functions, generalising the elementary functions and much more robust than them, and give characterisations of them both in terms of o-minimal local definability and in terms of their types in a reduct of the theory of differentially closed fields.

We then prove the analogue of Liouville's theorem for these exponentially-algebraic functions and give some new decidability results.

This is joint work with Rémi Jaoui, Lyon

Pfaffian functions, and by extension Pfaffian and semi-Pfaffian sets, play a crucial role in various areas of mathematics, including o-minimal theory. Incidence combinatorics has recently experienced a surge of activity, fuelled by the introduction of the polynomial partitioning method of Guth and Katz. While traditionally restricted to simple geometric objects such as points and lines, focus has shifted towards incidence questions involving higher dimensional algebraic or semi-algebraic sets. We present a generalization of the polynomial partitioning method to semi-Pfaffian sets and illustrate how this leads to Pfaffian generalizations of classic results in incidence geometry, such as the Szemerédi-Trotter Theorem. Finally, we outline an application of semi-Pfaffian geometry and Khovanskii's bound to the robustness of neural networks.