The Method of Tree-hypersequents for Modal Propositional Logic - HAL Accéder directement au contenu
Chapitre d'ouvrage Année : 2009

The Method of Tree-hypersequents for Modal Propositional Logic

Résumé

In this paper we present a method, that we call the tree-hypersequent method, for generating contraction-free and cut-free sequent calculi for modal propositional logics. We show how this method works for the systems K, KD, K4 and KD4, by giving a sequent calculus for these systems which are normally presented in the Hilbert style, and by proving all the main results in a purely syntactical way.
Fichier principal
Vignette du fichier
BookChapter-Springer 2009.pdf ( 200.84 Ko ) Télécharger
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

halshs-00775815, version 1 (06-09-2018)

Identifiants

Citer

Francesca Poggiolesi. The Method of Tree-hypersequents for Modal Propositional Logic. David Makinson, Jacek Malinowski, Heinrich Wansing. Towards Mathematical Philosophy, 28, Springer, pp.31-51, 2009, Trends in logic, 978-1-4020-9083-7. ⟨10.1007/978-1-4020-9084-4_3⟩. ⟨halshs-00775815⟩
76 Consultations
336 Téléchargements
Dernière date de mise à jour le 28/04/2024
comment ces indicateurs sont-ils produits

Altmetric

Partager

Gmail Facebook Twitter LinkedIn Plus