Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents
Not on the map. Why?
Abstract (arXiv)
We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 11 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 1.
4 papers.
- 2022Automating Reasoning with Standpoint Logic via Nested Sequentscited by 3
- 2022Uniform and Modular Sequent Systems for Description Logicscited by 1
- 2024Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequentscited by 1
- 2023Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rulescited by 0
- 2024Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents24 Apr 2024
- 2023Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules5 Jun 2023
- 2022Uniform and Modular Sequent Systems for Description Logics17 Jun 2022
- 2022Automating Reasoning with Standpoint Logic via Nested Sequents5 May 2022