Year: 2025
Type: article
Abstract: Proof theorists have long been struggling to provide simple accounts of various modal logics. Drawing on the recent literature on metainferences, I develop in the present paper a novel approach to this challenge: regular sequent systems augmented with natural deduction-like rules for assuming and discharging sequents. Based on this approach, I introduce an elegant calculus for the modal logic $S4$. Various discharging conditions on assumptions are shown to yield the weaker logics $K,D$, and $T$. The rules in these calculi have attractive proof-theoretic properties: they are explicit, symmetrical, and non-circular, and they enjoy the subformula property.
Source: Logic Journal of IGPL
Author: Rea Golan
Institution: Ben-Gurion University of the Negev
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $4,533
OpenAlex ID: W4410194312
