A Unified Gentzen-style Framework for Until-free LTL
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913632119422976 |
|---|---|
| author | Kamide, Norihiro Negri, Sara |
| author_facet | Kamide, Norihiro Negri, Sara |
| contents | A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent sequent calculus and a natural deduction system. Furthermore, an equivalence between these systems, alongside with proofs of cut-elimination and normalization theorems, is established. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_00494 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Unified Gentzen-style Framework for Until-free LTL Kamide, Norihiro Negri, Sara Logic in Computer Science F.4.1 A unified Gentzen-style framework for until-free propositional linear-time temporal logic is introduced. The proposed framework, based on infinitary rules and rules for primitive negation, can handle uniformly both a single-succedent sequent calculus and a natural deduction system. Furthermore, an equivalence between these systems, alongside with proofs of cut-elimination and normalization theorems, is established. |
| title | A Unified Gentzen-style Framework for Until-free LTL |
| topic | Logic in Computer Science F.4.1 |
| url | https://arxiv.org/abs/2501.00494 |