Proof Theory for Intuitionistic Strong Löb Logic
Abstract: This paper introduces two sequent calculi for intuitionistic strong L\"ob logic ${\sf iSL}\Box$: a terminating sequent calculus ${\sf G4iSL}\Box$ based on the terminating sequent calculus ${\sf G4ip}$ for intuitionistic propositional logic ${\sf IPC}$ and an extension ${\sf G3iSL}\Box$ of the standard cut-free sequent calculus ${\sf G3ip}$ without structural rules for ${\sf IPC}$. One of the main results is a syntactic proof of the cut-elimination theorem for ${\sf G3iSL}\Box$. In addition, equivalences between the sequent calculi and Hilbert systems for ${\sf iSL}\Box$ are established. It is known from the literature that ${\sf iSL}\Box$ is complete with respect to the class of intuitionistic modal Kripke models in which the modal relation is transitive, conversely well-founded and a subset of the intuitionistic relation. Here a constructive proof of this fact is obtained by using a countermodel construction based on a variant of ${\sf G4iSL}_\Box$. The paper thus contains two proofs of cut-elimination, a semantic and a syntactic proof.
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.