𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cut-free sequent calculi for some tense logics

✍ Scribed by Ryo Kashima

Publisher
Springer Netherlands
Year
1994
Tongue
English
Weight
691 KB
Volume
53
Category
Article
ISSN
0039-3215

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Cut-free tableau calculi for some propos
Cut-free tableau calculi for some propositional normal modal logics
✍ Martin Amerbauer πŸ“‚ Article πŸ“… 1996 πŸ› Springer Netherlands 🌐 English βš– 700 KB

We give sound and complete tableau and sequent calculi for the propositional normal modal logics $4.04, K4B and G O (these logics axe the smallest normal modal logics containing K and the schemata [:]A -+ ODA, DA --+ A and D<)DA --+ (A --+ DA) ; DA -+ D[]A and A -+ D<>A ; DA --+ D[qA and D(D(A --+ D

New sequent calculi for Visser's Formal
New sequent calculi for Visser's Formal Propositional Logic
✍ Katsumasa Ishii πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 128 KB

## Abstract Two cut‐free sequent calculi which are conservative extensions of Visser's Formal Propositional Logic (FPL) are introduced. These satisfy a kind of subformula property and by this property the interpolation theorem for FPL are proved. These are analogies to Aghaei‐Ardeshir's calculi for

Cut-elimination Theorems for Some Infini
Cut-elimination Theorems for Some Infinitary Modal Logics
✍ Yoshihito Tanaka πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 189 KB

In this article, a cut-free system TLMω 1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames. The system TLMω 1 is a kind of Gentzen style sequent calculus, but a sequent of TLMω 1 is defined as a finite tree of sequents in a standar