Introduction to Proof Theory II: Invertibility, Cut-Elimination, and Proof-search
Автор: Computational Logic Group TU Dresden
Загружено: 2022-01-14
Просмотров: 2559
Описание:
Speaker: Tim Lyon
Webpage: https://sites.google.com/view/timlyon
Abstract: 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: • Introduction to Proof Theory I: Sequent Ca... . Building off of the first talk, we will look at invertible rules, cut-elimination, and touch on how a logic can be shown decidable via proof-search. All such concepts will be introduced within the framework of a sequent calculus for classical propositional logic.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке: