Published November 24, 2025 | Version v1

Peano's Fragments and the Limits of Finite Computation

Description

This paper explores the intricate relationship between Giuseppe Peano's foundational axioms for arithmetic and the fundamental limits inherent in finite computation. Peano's work, particularly his set of axioms for natural numbers, laid a rigorous foundation for number theory, aiming for a complete and consistent formalization of arithmetic. However, the subsequent discovery of Gödel's incompleteness theorems revealed intrinsic limitations in any sufficiently powerful formal system, including Peano Arithmetic. These "fragments" of Peano's ambition, where truth outstrips provability, have profound implications for the capabilities of finite computational systems. We delve into how the formal properties of Peano Arithmetic, when viewed through the lens of computability theory and undecidability, delineate what can and cannot be effectively computed or proven by algorithms operating within finite constraints. The paper examines the historical context of foundational crises in mathematics, the development of Hilbert's program, and its eventual refutation by Gödel, thereby establishing a theoretical framework for understanding these computational boundaries. We discuss the conceptual gaps between formal systems and mathematical truth, the existence of non-standard models, and the practical and philosophical ramifications for automated reasoning and the philosophy of mathematics. This analysis introduces the perspective of "dynamic fragmentation," arguing that these limits are not merely static gaps but rather an unavoidable, generative process inherent in any sufficiently powerful formal system aiming to fully capture arithmetic truth through finite means.

Files

paper.pdf

Files (273.9 kB)

Name Size
md5:bc6bfe4ab4aa2f392aa642cf133d67e9
273.9 kB Preview Download