Universal Proof Theory, TACL 2022 Lecture Notes

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Iemhoff, Rosalie, Jalali, Raheleh
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866915598994243584
author Iemhoff, Rosalie
Jalali, Raheleh
author_facet Iemhoff, Rosalie
Jalali, Raheleh
contents These lecture notes survey the emerging area of Universal Proof Theory, which investigates general questions about the existence, equivalence, and characterization of good proof systems for broad classes of logics. In particular, the notes concentrate on the existence problem: for which logics do there exist proof systems satisfying desirable meta-properties (e.g. cut elimination, analyticity, termination)? After a brief historical and conceptual introduction, we survey different flavours of proof theory (Hilbert systems, natural deduction, sequent calculi) in the context of classical, intuitionistic, modal, and substructural logics. We then develop a general method for obtaining positive and negative existence results, based on interpolation and uniform interpolation techniques, and apply it to a range of logics (intermediate, modal, non-normal, conditional, and substructural). We also discuss variations of the method. As these are lecture notes, proofs are often sketched or omitted, with pointers to papers containing the full proofs. The survey thus aims to chart the scope and challenges of Universal Proof Theory for future work.
format Preprint
id arxiv_https___arxiv_org_abs_2305_10888
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Universal Proof Theory, TACL 2022 Lecture Notes
Iemhoff, Rosalie
Jalali, Raheleh
Logic
Logic in Computer Science
These lecture notes survey the emerging area of Universal Proof Theory, which investigates general questions about the existence, equivalence, and characterization of good proof systems for broad classes of logics. In particular, the notes concentrate on the existence problem: for which logics do there exist proof systems satisfying desirable meta-properties (e.g. cut elimination, analyticity, termination)? After a brief historical and conceptual introduction, we survey different flavours of proof theory (Hilbert systems, natural deduction, sequent calculi) in the context of classical, intuitionistic, modal, and substructural logics. We then develop a general method for obtaining positive and negative existence results, based on interpolation and uniform interpolation techniques, and apply it to a range of logics (intermediate, modal, non-normal, conditional, and substructural). We also discuss variations of the method. As these are lecture notes, proofs are often sketched or omitted, with pointers to papers containing the full proofs. The survey thus aims to chart the scope and challenges of Universal Proof Theory for future work.
title Universal Proof Theory, TACL 2022 Lecture Notes
topic Logic
Logic in Computer Science
url https://arxiv.org/abs/2305.10888