A new introduction rule for disjunction
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914108050243584 |
|---|---|
| author | Díaz-Caro, Alejandro Dowek, Gilles |
| author_facet | Díaz-Caro, Alejandro Dowek, Gilles |
| contents | We extend Natural Deduction for intuitionistic logic with a third introduction rule for the disjunction, $\vee$-i3, with a conclusion $Γ\vdash A\vee B$, but both premises $Γ\vdash A$ and $Γ\vdash B$. This rule is admissible in Natural Deduction. This extension is interesting in several respects. First, it permits to solve a well-known problem in logics with interstitial rules that have a weak introduction property: closed cut-free proofs end with an introduction rule, except in the case of disjunctions. With this new introduction rule, we recover the strong introduction property: closed cut-free proofs always end with an introduction. Second, the termination proof of this proof system is simpler than that of the usual propositional Natural Deduction with interstitial rules, as it does not require the use of the so-called ultra-reduction rules. Third, this proof system, in its linear version, has applications to quantum computing: the $\vee$-i3 rule enables the expression of quantum measurement, without the cost of introducing a new connective. Finally, even in logics without interstitial rules, the rule $\vee$-i3 is useful to reduce commuting cuts, although, in this paper, we leave the termination of such reduction as an open problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19172 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A new introduction rule for disjunction Díaz-Caro, Alejandro Dowek, Gilles Logic in Computer Science We extend Natural Deduction for intuitionistic logic with a third introduction rule for the disjunction, $\vee$-i3, with a conclusion $Γ\vdash A\vee B$, but both premises $Γ\vdash A$ and $Γ\vdash B$. This rule is admissible in Natural Deduction. This extension is interesting in several respects. First, it permits to solve a well-known problem in logics with interstitial rules that have a weak introduction property: closed cut-free proofs end with an introduction rule, except in the case of disjunctions. With this new introduction rule, we recover the strong introduction property: closed cut-free proofs always end with an introduction. Second, the termination proof of this proof system is simpler than that of the usual propositional Natural Deduction with interstitial rules, as it does not require the use of the so-called ultra-reduction rules. Third, this proof system, in its linear version, has applications to quantum computing: the $\vee$-i3 rule enables the expression of quantum measurement, without the cost of introducing a new connective. Finally, even in logics without interstitial rules, the rule $\vee$-i3 is useful to reduce commuting cuts, although, in this paper, we leave the termination of such reduction as an open problem. |
| title | A new introduction rule for disjunction |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2502.19172 |