z-logo
Premium
Modal Tree‐Sequents
Author(s) -
Cerrato Claudio
Publication year - 1996
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/malq.19960420117
Subject(s) - modal , mathematics , tree (set theory) , calculus (dental) , algebra over a field , discrete mathematics , pure mathematics , combinatorics , medicine , chemistry , dentistry , polymer chemistry
We develop cut‐free calculi of sequents for normal modal logics by using treesequents, which are trees of sequences of formulas. We introduce modal operators corresponding to the ways we move formulas along the branches of such trees, only considering fixed distance movements. Finally, we exhibit syntactic cut‐elimination theorems for all the main normal modal logics. Mathematics Subject Classification: 03B45, 03F05.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here