An Introduction to Proof Theory II: More on the Sequent Calculus

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

An Introduction to Proof Theory II: More on the Sequent Calculus

Vortrag von Tim Lyon
This talk is a sequel to the first lecture "An Introduction to Proof Theory I: Sequent Calculus," which can be found at the following link: https://www.youtube.com/watch?v=grjMRgmjddE. In this talk, we will briefly review notions introduced in the first talk such as what a sequent is, types of inference rules, and types of rule redundancy. Building off these notions, we will then look at invertible rules, cut-elimination, and touch on how logics can be shown decidable via proof-search. All such concepts will be introduced within the framework of a sequent calculus for classical propositional logic.

The talk is online via BigBlueButton.

Link:

https://bbb.tu-dresden.de/b/ali-zgz-l8d-52n