Order-theoretic fixed point theorems

Add to your list(s) Download to your calendar using vCal

• Paul Taylor (Computer Science, University of Birmingham, honorary)
• Friday 09 December 2022, 13:30-14:20
• LG23, Computer Science // Zoom.

If you have a question about this talk, please contact George Kaye.

Abstract

Some messy history of messy classical proofs and a simple constructive proof with applications to messy algebra.

I will survey the history of classical and constructive fixed point theorems in order theory, demonstrating that most of the attributions are wrong and why not to use transfinite recursion.

I will conclude with a constructive theorem that can do everything that the older ones could do, but has a simpler proof and is easier to use.

slides and paper

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.