Metraipolis › archive › dc_61ebf670d6ea
Arithmetical Characterizations of Two Intuitionistic Logical Principles — arXiv:2610.40829
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40829
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:06:54.310Z
- SHA-256 of the archived text
d09b8d49ca676370a12f981cd74153e49d44297ba9944459f57d7e19dae8ebca- Stable URL of this page
https://metraipolis.com/documento/dc_61ebf670d6ea
How to cite
Arithmetical Characterizations of Two Intuitionistic Logical Principles — arXiv:2610.40829 — arXiv (en), https://arxiv.org/abs/2610.40829 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_61ebf670d6ea (Metraipolis archive dc_61ebf670d6ea, sha256 d09b8d49ca676370a12f981cd74153e49d44297ba9944459f57d7e19dae8ebca)
BibTeX
@misc{dc61ebf670d6ea,
title = {Arithmetical Characterizations of Two Intuitionistic Logical Principles — arXiv:2610.40829},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40829},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_61ebf670d6ea; sha256 d09b8d49ca676370a12f981cd74153e49d44297ba9944459f57d7e19dae8ebca},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40829. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper investigates the role of negation in arithmetic by analyzing subsystems based on subminimal logic. We introduce NA^PR, a system of subminimal arithmetic equipped with all primitive recursive functions, and answer the following four questions: (1) Can we develop reasonable arithmetic within NA^PR? (2) Can we characterize logical rules Absorption of Negation (An) and Ex Falso Quodlibet (ECQ) by arithmetical principles? (3) Are there strict differences in deductive power among NA^PR, MA^PR, and HA? (4) Do MA^PR and MA, and NA^PR and NA have a similar mutual interpretability relationship as HA? We show the following: First, Heyting Arithmetic (HA) is shown to be a conservative extension of NA^PR for positive formulas. Based on NA^PR, we prove that (ECQ) is equivalent to the definability of disjunction, and that (An) is equivalent to a variant of the least number principle. Furthermore, using the constant domain neighbourhood semantics, we show that the systems NA^PR, MA^PR (written as NA^PR+(An)) and HA (written as NA^PR+(An)+(ECQ)) form a strictly increasing hierarchy of strength. Finally, we demonstrate the essential role of primitive recursive functions in weak arithmetic using classical countermodels. 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.40829 — 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.643Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).