University of Cambridge > > Isaac Newton Institute Seminar Series > Well-quasi-orderings for progam analysis and computational complextiy

Well-quasi-orderings for progam analysis and computational complextiy

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

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

Mathematical, Foundational and Computational Aspects of the Higher Infinite

Co-author: Sylvain Schmitz (ENS Cachan)

The talk will survey some of the applications of well-quasi-orderings in computer science. Well-quasi-orderings are an important tool in some areas like program verification, or computer-aided deduction and theorem-proving. Most importantly, they provide easy proofs for the decidability of logical or combinatorial problems. Recent work by the authors aim at extracting computational complexity bounds from decidability proofs that rely on well-quasi-orderings.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity