2000 character limit reached
Circular Proofs for Gödel-Löb Logic
Published 16 Jan 2014 in math.LO and cs.LO | (1401.4002v1)
Abstract: We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish Lindon interpolation for GL syntactically.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.