Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation

In [7] and [8], Iemhoff introduced a connection between the existence of a terminating sequent calculi of a certain kind and the uniform interpolation property of the super-intuitionistic logic that the calculus captures. In this paper, we will generalize this relationship to also cover the substructural setting on the one hand and a much more powerful class of rules on the other. The resulted relationship then provides a uniform method to establish uniform interpolation property for the logics FL_e, FL_ew, CFL_e, CFL_ew, IPC, CPC and their K and KD-type modal extensions. More interestingly though, on the negative side, we will show that no extension of FL_e can enjoy a certain natural type of terminating sequent calculus unless it has the uniform interpolation property. It excludes almost all super-intutionistic logics and the logics K4 and S4 from having such a reasonable calculus.

READ FULL TEXT
research
08/19/2018

Universal Proof Theory: Semi-analytic Rules and Craig Interpolation

In [6], Iemhoff introduced the notion of a focused axiom and a focused r...
research
08/10/2022

Uniform Lyndon Interpolation for Basic Non-normal Modal and Conditional Logics

In this paper, a proof-theoretic method to prove uniform Lyndon interpol...
research
07/21/2023

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation

We introduce a Gentzen-style framework, called layered sequent calculi, ...
research
08/09/2022

Uniform Lyndon interpolation for intuitionistic monotone modal logic

In this paper we show that the intuitionistic monotone modal logic 𝗂𝖬 ha...
research
05/23/2021

Uniform interpolation via nested sequents and hypersequents

A modular proof-theoretic framework was recently developed to prove Crai...
research
04/23/2020

On the proof complexity of logics of bounded branching

We investigate the proof complexity of extended Frege (EF) systems for b...
research
07/17/2023

On P-Interpolation in Local Theory Extensions and Applications to the Study of Interpolation in the Description Logics EL, EL^+

We study the problem of P-interpolation, where P is a set of binary pred...

Please sign up or login with your details

Forgot password? Click here to reset