English

Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation

Logic in Computer Science 2025-06-27 v2 Logic

Abstract

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must satisfy the Craig interpolation property. In this paper, we show that if the calculus is also terminating in a certain formal sense, then its logic has the Uniform Interpolation Property (UIP). This result has significant applications. On the positive side, it provides a uniform and modular method for proving UIP for various logics, including FLe\mathsf{FL_e}, FLew\mathsf{FL_{ew}}, CFLe\mathsf{CFL_e}, CFLew\mathsf{CFL_{ew}}, and their KK, DD, and TT-type modal extensions, as well as CPC\mathsf{CPC}, K\mathsf{K}, and KD\mathsf{KD}. However, its more striking consequence lies in the negative direction. It extends the negative results of \cite{Craig} to logics with CIP but without UIP. In particular, it shows that the modal logics K4\mathsf{K4} and S4\mathsf{S4} do not have a terminating semi-analytic calculus. \textbf{keywords:} Uniform interpolation, Sequent calculi, Substructural logics, Modal logics, Subexponential modalities

Keywords

Cite

@article{arxiv.1808.06258,
  title  = {Universal Proof Theory: Semi-analytic Rules and Uniform Interpolation},
  author = {Amirhossein Akbar Tabatabai and Raheleh Jalali},
  journal= {arXiv preprint arXiv:1808.06258},
  year   = {2025}
}

Comments

56 pages. arXiv admin note: text overlap with arXiv:1808.06256

R2 v1 2026-06-23T03:37:51.679Z