MODULAR SEQUENT CALCULI FOR INTERPRETABILITY LOGICS

Abstract An original family of labelled sequent calculi $\mathsf {G3IL}^{\star }$ for classical interpretability logics is presented, modularly designed on the basis of Verbrugge semantics (a.k.a. generalised Veltman semantics) for those logics. We prove that each of our calculi enjoys excellent structural properties, namely, admissibility of weakening, contraction and, more relevantly, cut. A complexity measure of the cut is defined by extending the notion of range previously introduced by Negri w.r.t. a labelled sequent calculus for Gödel–Löb provability logic, and a cut-elimination algorithm is discussed in detail. To our knowledge, this is the most extensive and structurally well-behaving class of analytic proof systems for modal logics of interpretability currently available in the literature.

Authors

Institutions

Publication Details

Journal
The Review of Symbolic Logic
Published
2025-08-08
DOI
https://doi.org/10.1017/s1755020325100701
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

MODULAR SEQUENT CALCULI FOR INTERPRETABILITY LOGICS

Nicola Olivetti, Cosimo Perini Brogi, Sara Negri
The Review of Symbolic Logic
Logic, Reasoning, and Knowledge
article

MODULAR SEQUENT CALCULI FOR INTERPRETABILITY LOGICS

Nicola Olivetti, Cosimo Perini Brogi, Sara Negri
article en

Abstract

Abstract An original family of labelled sequent calculi $\mathsf {G3IL}^{\star }$ for classical interpretability logics is presented, modularly designed on the basis of Verbrugge semantics (a.k.a. generalised Veltman semantics) for those logics. We prove that each of our calculi enjoys excellent structural properties, namely, admissibility of weakening, contraction and, more relevantly, cut. A complexity measure of the cut is defined by extending the notion of range previously introduced by Negri w.r.t. a labelled sequent calculus for Gödel–Löb provability logic, and a cut-elimination algorithm is discussed in detail. To our knowledge, this is the most extensive and structurally well-behaving class of analytic proof systems for modal logics of interpretability currently available in the literature.

The Review of Symbolic Logic
IMT School for Advanced Studies Lucca (IT), Aix-Marseille Université (FR), University of Genoa (IT)
Openalex Percentile: Top 89%
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

MODULAR SEQUENT CALCULI FOR INTERPRETABILITY LOGICS — Nicola Olivetti, Cosimo Perini Brogi, et al. · The Review of Symbolic Logic (2025) | TGRS Research Map | TGRS