Labeled Natural Deduction Systems for a Family of Tense Logics
| dc.creator | Viganò, Luca | |
| dc.creator | Volpe, Marco | |
| dc.date | 2008-03-21 | |
| dc.date | 2008-03-25 | |
| dc.date.accessioned | 2026-07-07T09:28:01Z | |
| dc.date.available | 2026-07-07T09:28:01Z | |
| dc.description | We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of useful normalization properties (in particular, derivations reduce to a normal form that enjoys a subformula property). We also discuss how to extend our systems to capture richer logics like (fragments of) LTL. | |
| dc.identifier | https://arxiv.org/abs/0803.3187 | |
| dc.identifier | http://arxiv.org/abs/0803.3187 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157306 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1 | |
| dc.title | Labeled Natural Deduction Systems for a Family of Tense Logics | |
| dc.type | text |