{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T15:40:06Z","timestamp":1756395606676,"version":"3.44.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T00:00:00Z","timestamp":1756339200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T00:00:00Z","timestamp":1756339200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T00:00:00Z","timestamp":1756339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,24]]},"abstract":"<jats:p>Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\u03bc$MALL as a formal theory of arithmetic based on linear logic. This formal system is presented as a sequent calculus proof system that extends the standard proof system for multiplicative-additive linear logic (MALL) with the addition of the logical connectives universal and existential quantifiers (first-order quantifiers), term equality and non-equality, and the least and greatest fixed point operators. We first demonstrate how functions defined using $\u03bc$MALL relational specifications can be computed using a simple proof search algorithm. By incorporating weakening and contraction into $\u03bc$MALL, we obtain $\u03bc$LK+, a natural candidate for a classical sequent calculus for arithmetic. While important proof theory results are still lacking for $\u03bc$LK+ (including cut-elimination and the completeness of focusing), we prove that $\u03bc$LK+ is consistent and that it contains Peano arithmetic. We also prove some conservativity results regarding $\u03bc$LK+ over $\u03bc$MALL.<\/jats:p><jats:p>27 pages<\/jats:p>","DOI":"10.46298\/fi.12736","type":"journal-article","created":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T15:05:15Z","timestamp":1756393515000},"source":"Crossref","is-referenced-by-count":0,"title":["Peano Arithmetic and $\u03bc$MALL"],"prefix":"10.46298","volume":"Volume 194, Issue 2: Fixed...","author":[{"given":"Matteo","family":"Manighetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dale","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2025,8,28]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/2312.13634v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/2312.13634v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T15:05:15Z","timestamp":1756393515000},"score":1,"resource":{"primary":{"URL":"https:\/\/fi.episciences.org\/12736"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,28]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/fi.12736","relation":{"has-preprint":[{"id-type":"arxiv","id":"2312.13634v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2312.13634v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2312.13634","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2312.13634","asserted-by":"subject"}]},"ISSN":["1875-8681"],"issn-type":[{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,28]]},"article-number":"12736"}}