University of Cambridge > > Mini Courses in Theoretical Computer Science > Mini course on proof theory (Part 3)

Mini course on proof theory (Part 3)

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

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

Sequent calculus, abstract machines, focalised classical logic, CPS translations, a bit of ludics, and an even smaller bit of linear logic (in this not quite historical order!). Syntax, and just syntax! (categories could squeeze in, but only time—and preparation time!—permitting)

This talk is part of the Mini Courses in Theoretical Computer Science series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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