Cyclic Proof Theory

From International Center for Computational Logic

Cyclic Proof Theory

Talk by Bahareh Afshari (University of Gothenburg)
Proofs are a central tool in mathematics and a core concept in the study of formal reasoning. Traditionally, a proof is conceived as a finite object which is used to certify the correctness of our mathematical structures and their properties. Less common are so called cyclic proofs which, although infinitary, exhibit periodic patterns. Cyclic proof systems have proven to be a remarkably useful alternative in the mathematical study of computational systems, particularly in connection with algorithms, databases and programs. In this talk we will introduce cyclic proofs and study the extent to which these classes of proofs lend themselves to traditional proof theoretic techniques.