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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Well-quasi-orderings for progam analysis and computational complextiy

Download to your calendar using vCal

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Webinar & SS03, Computer Laboratory, William Gates Building. Life Sciences & Society ONLY ONLY. Here is the Google Meet Link: https://meet.google.com/cru-hcuo-rhu

Other talks

RNA-Mediated Regulation of Germinal Centre B-Cell Fitness: a tale of two DEAD-box RNA helicases Kirk Public Lecture | A proxy window into the beautiful and challenging world of causal attribution Quantum optics with organic molecules LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Title to be confirmed Cooperation for Nature
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity