Tree-sequent calculi and decision procedures for intuitionistic modal logics - Archive ouverte HAL
Article Dans Une Revue Journal of Logic and Computation Année : 2018

Tree-sequent calculi and decision procedures for intuitionistic modal logics

Didier Galmiche
Yakoub Salhi

Résumé

In this article we define label-free sequent calculi for the intuitionistic modal logics obtained from the combinations of the axioms T, B, 4 and 5. These calculi are based on a multi-contextual sequent structure, called Tree-sequent, which allows us to define such calculi for such intuitionistic modal logics. From the calculi defined for the IK, IT, IB4 and ITB logics, we also provide new decision procedures and alternative syntactic proofs of decidability.
Fichier non déposé

Dates et versions

hal-01258490 , version 1 (19-01-2016)

Identifiants

Citer

Didier Galmiche, Yakoub Salhi. Tree-sequent calculi and decision procedures for intuitionistic modal logics. Journal of Logic and Computation, 2018, 28 (5), pp.967-989. ⟨10.1093/logcom/exv039⟩. ⟨hal-01258490⟩
115 Consultations
0 Téléchargements

Altmetric

Partager

More