Twist Sequent Calculi for S4 and its Neighbors

Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated.The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several twist logical inference rules for negated logical connectives.Using these calculi, short proofs can be generated for provable negated modal formulas that contain numerous negation connectives.The cut-elimination theorems for the calculi are proved, and the subformula properties for the calculi are also obtained.Additionally, Gentzen-style twist (hyper)sequent calculi for other normal modal logics including S5 are considered.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2024-12-28
DOI
https://doi.org/10.4204/eptcs.415.6
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Twist Sequent Calculi for S4 and its Neighbors

Norihiro Kamide
Electronic Proceedings in Theoretical Computer Science
Logic, programming, and type systems
article

Twist Sequent Calculi for S4 and its Neighbors

Norihiro Kamide
article en

Abstract

Two Gentzen-style twist sequent calculi for the normal modal logic S4 are introduced and investigated.The proposed calculi, which do not employ the standard logical inference rules for the negation connective, are characterized by several twist logical inference rules for negated logical connectives.Using these calculi, short proofs can be generated for provable negated modal formulas that contain numerous negation connectives.The cut-elimination theorems for the calculi are proved, and the subformula properties for the calculi are also obtained.Additionally, Gentzen-style twist (hyper)sequent calculi for other normal modal logics including S5 are considered.

Electronic Proceedings in Theoretical Computer ScienceVol. 415
Nagoya City University (JP)
Japan Society for the Promotion of Science
Zero hunger
Openalex Percentile: Top 78%
Logic, programming, and type systems
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.