Proof Society Seminar
Welcome!
The Proof Society Seminar is the official seminar of the Proof Society, and it presents talks by leading researchers from all areas of proof theory. The aims of the seminar are closely aligned with the Proof Society’s Manifesto, particularly in enabling communication within the broader scientific community. Everyone who is interested in the subject is warmly invited to attend!
The talks take place online via Zoom, usually on Mondays, approximately once per month. They start at 13:00 UTC and may last up to 75 minutes plus questions.
To attend, please join our Zoom meeting via https://bham-ac-uk.zoom.us/j/84261727269
You can also subscribe to our mailing list to receive announcements of the upcoming talks: http://groups.google.com/forum/#!forum/proof-society-seminar
Recordings of the seminars are available at this YouTube channel.
Upcoming talks
Click on each item to reveal the abstract.
03/03/25, Henry Towsner (University of Pennsylvania), Proofs that Modify Proofs
Date: 03/03/2025
Speaker: Henry Towsner (University of Pennsylvania)
Title: Proofs that Modify Proofs
Abstract: In this talk, we outline an approach to cut-elimination for full second order arithmetic using a modified form of the Buchholz Omega-rule. The usual Buchholz Omega-rule is a rule branching over (“small”) deductions; this method works for systems around the strength of Pi11-comprehension, but breaks down approaching Pi12-comprehension.
We describe an extended sequent calculus in which the cut-elimination functions can themselves be represented by non-well-founded deductions. The Omega-rule can then be reinterpreted as a rule which takes a function as a premise. The extension to Pi12-comprehension then requires us to work with functionals—that is, functions on functions—and iterating through the finite types extends the method to full second order arithmetic. We will also briefly describe how to assign “ordinals” to non-well-founded deductions to extract an ordinal analysis from the cut-elimination algorithm.
Previous talks, slides and recordings
Click on each item to reveal the abstract and the recording.
03/02/25, Jeremy Avigad (Carnegie Mellon University), Verifying Proofs on Blockchain
Date: 03/02/2025
Speaker: Jeremy Avigad (Carnegie Mellon University)
Title: Verifying Proofs on Blockchain
Abstract: In cryptography, a *proof system* is a protocol between a prover and a verifier that enables the prover to convince the verifier that a claim is true. They are often probabilistic; given a source of randomness, it is often more efficient to convince the verifier only that it is very likely that the claim is true. Such proof systems now have interesting applications to blockchain technology, where they are used, among other things, to validate the execution of smart contracts. It is easy to make mistakes when implementing cryptographic protocols and designing smart contracts, and billions of dollars are lost to hacks every year. Fortunately, another proof technology can help: interactive proof assistants, which have long been used to verify hardware and software systems, can also be used to verify the correctness of cryptographic protocols. In this talk, I will describe some formal verification efforts I have carried out with colleagues at StarkWare Industries using the Lean proof assistant.. I will explain some of the ideas behind smart contracts and interactive proof assistants without assuming familiarity with either.
Slides and Recording
About the seminar
The seminar organiser is Lev D. Beklemishev, who can be contacted at levbekl_at_gmail_dot_com
The seminar board consists of the committee members of the Proof Society. This seminar is a reincarnation of the Proof Theory Virtual Seminar that existed in 2020-21.