Unified Gentzen Approach to Connexive Logics over Wansing's C
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913632136200192 |
|---|---|
| author | Kamide, Norihiro |
| author_facet | Kamide, Norihiro |
| contents | Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing's basic connexive logic C. The C-family is derived from C by incorporating the Peirce law, the law of excluded middle, and the generalized law of excluded middle. Theorems establishing equivalence between the proposed sequent calculi and natural deduction systems are demonstrated. Cut-elimination and normalization theorems are established for the proposed sequent calculi and natural deduction systems, respectively. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_00498 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unified Gentzen Approach to Connexive Logics over Wansing's C Kamide, Norihiro Logic in Computer Science F.4.1 Gentzen-style sequent calculi and Gentzen-style natural deduction systems are introduced for a family (C-family) of connexive logics over Wansing's basic connexive logic C. The C-family is derived from C by incorporating the Peirce law, the law of excluded middle, and the generalized law of excluded middle. Theorems establishing equivalence between the proposed sequent calculi and natural deduction systems are demonstrated. Cut-elimination and normalization theorems are established for the proposed sequent calculi and natural deduction systems, respectively. |
| title | Unified Gentzen Approach to Connexive Logics over Wansing's C |
| topic | Logic in Computer Science F.4.1 |
| url | https://arxiv.org/abs/2501.00498 |