Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

TABLEAUX
2009
Springer

favoriteEmaildiscussreport

258views Artificial Intelligence» more TABLEAUX 2009»

Modular Sequent Systems for Modal Logic

13 years 11 months ago

Modular Sequent Systems for Modal Logic

Download www.iam.unibe.ch

We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a corresponding rule and each combination of these rules is complete for the corresponding frame conditions. The systems are based on nested sequents, a natural generalisation of hypersequents. Nested sequents stay inside the modal language, as opposed to both the display calculus and labelled sequents. The completeness proof is via syntactic cut elimination.

Kai Brünnler, Lutz Straßburger

Real-time Traffic

Artificial Intelligence | Cut-free Sequent Systems | Nested Sequents | Normal Modal Logics | TABLEAUX 2009 |

claim paper

Related Content

» A Uniform Procedure for Converting Matrix Proofs into SequentStyle Systems

» Proof systems for the coalgebraic cover modality

» Fusion of sequent modal logic systems labelled with truth values

» Deep Sequent Systems for Modal Logic

» Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief

» Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics

» A System of Interaction and Structure

» A CutFree Sequent System for the Smallest Interpretability Logic

» CutElimination and Proof Search for BiIntuitionistic Tense Logic

Post Info
More Details (n/a)

Added	27 May 2010
Updated	27 May 2010
Type	Conference
Year	2009
Where	TABLEAUX
Authors	Kai Brünnler, Lutz Straßburger

Comments (0)