Metraipolis › archive › dc_bb774169a617
Restricted Peirce's Law and Natural Deduction — arXiv:2610.40813
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40813
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:06:52.628Z
- SHA-256 of the archived text
6fd5b965e062ce3f0808f8700066e5e2cca2f6fa5b19f82f3e849281bce3371b- Stable URL of this page
https://metraipolis.com/documento/dc_bb774169a617
How to cite
Restricted Peirce's Law and Natural Deduction — arXiv:2610.40813 — arXiv (en), https://arxiv.org/abs/2610.40813 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bb774169a617 (Metraipolis archive dc_bb774169a617, sha256 6fd5b965e062ce3f0808f8700066e5e2cca2f6fa5b19f82f3e849281bce3371b)
BibTeX
@misc{dcbb774169a617,
title = {Restricted Peirce's Law and Natural Deduction — arXiv:2610.40813},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40813},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bb774169a617; sha256 6fd5b965e062ce3f0808f8700066e5e2cca2f6fa5b19f82f3e849281bce3371b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40813. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The constructive logic JP' is known to be the weakest logic between intuitionistic and minimal logic that satisfies Glivenko's theorem. In spite of this natural and desirable formal property, the motivation for its notion of negation remains rather elusive: it can be characterised by a restriction of Peirce's law or by the double negation of ex falso quodlibet, neither of which is very intuitive. In order to have an alternative perspective on this negation, we study in this paper a couple of natural deduction systems for JP'. We first present a system that is normalisable and satisfies a restricted form of the subformula property. Then a modification of this system is introduced, whose rules satisfy the separation of connectives and the full subformula property. Afterwards we turn our attention to a typed lambda-calculus, with respect to which our natural deduction enjoys the Curry-Howard correspondence, followed by a concluding discussion. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno). Categorie arXiv: Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2610.40813 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:45:30.640Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).