## Terms for Classical Sequents: Proof Invariants and Strong Normalisation

#### May 10, 2016

I’m giving a talk entitled “Terms for Classical Sequents: Proof Invariants and Strong Normalisation” at the University of Gothenburg Logic Seminar, via Skype.

Abstract: A proof for a sequent $$\Sigma\vdash\Delta$$ shows you how to get from the premises $$\Sigma$$ to the conclusion $$\Delta$$. It seems very plausible that some valid sequents have different proofs. It also seems plausible that some different derivations for the one sequent don’t represent different proofs, but are merely different ways to present the same proof. These two plausible ideas are hard to make precise, especially in the case of classical logic.

In this paper, I give a new account of a kind of invariant for derivations in the classical sequent calculus, and show how it can formalise a notion of proof identity with pleasing behaviour. In particular, it has a confluent, strongly normalising cut elimination procedure.

### about

I’m Greg Restall, and this is my personal website. I teach philosophy and logic as Professor of Philosophy at the University of Melbourne. ¶ Start at the home page of this site—a compendium of recent additions around here—and go from there to learn more about who I am and what I do. ¶ This is my personal site on the web. Nothing here is in any way endorsed by the University of Melbourne.

### subscribe

To receive updates from this site, you can subscribe to the  RSS feed of all updates to the site in an RSS feed reader, or follow me on Twitter at  @consequently, where I’ll update you if anything is posted.