Circular proofs for the Gödel-Löb provability logic
- 68 Downloads
Sequent calculus for the provability logic GL is considered, in which provability is based on the notion of a circular proof. Unlike ordinary derivations, circular proofs are represented by graphs allowed to contain cycles, rather than by finite trees. Using this notion, we obtain a syntactic proof of the Lyndon interpolation property for GL.
Keywordsprovability logic sequent calculus circular proof the Gödel-Löb logic the Lyndon interpolation property split sequent
Unable to display preview. Download preview PDF.
- 12.W. W. Tait, “Normal derivability in classical logic,” in The Syntax and Semantics of Infinitary Languages, Lecture Notes in Math. (Springer-Verlag, Berlin, 1986), Vol. 72, pp. 204–236.Google Scholar
- 14.J. Brotherston, Sequent Calculus Proof Systems for Inductive Definitions, PhD Thesis (Univ. of Edinburgh, Edinburgh, 2006).Google Scholar
- 17.C. Smoryński, “Modal logic and self-reference,” in Handbook of Philosophical Logic, Vol. II. Extensions of Classical Logic, Synthese Lib. (Reidel, Dordrecht, 1984), Vol. 165, pp. 441–495.Google Scholar