SearcharxivSearch

arXiv · 2607.05838

The Pirah\~a and the cognitive gap in Frege's theorem: Hume's principle without the #

Abstract

Frege's theorem proves that Hume's principle, in second-order logic, yields all of arithmetic. Yet the Pirah\~a people show one-to-one correspondence (equinumerosity) only where pairing can be enacted, with its range extended under local training, and still have no counting or arithmetic. We argue this is not a paradox but a matter of precise localization. Hume's principle includes a cardinality operator # that names cardinals as objects (often modeled as equivalence classes of equinumerous concepts), and what the Pirah\~a lack is not the relation but this operator. We identify the number-word practice as the cognitive realization of #, which recasts the "number-as-cognitive-technology" thesis in formal terms and locates the cognitive boundary at symbolization, not recursion. The identification is generative, not decorative: the reach of # tracks the reach of the token practice that carries it, so across languages and cultures we see a gradient, not a sharp cliff. And number words are not special as words; what # needs is any stable, reusable marker that can preserve exact cardinal identity across absence, rearrangement, delay, or modality shift: a spoken numeral, a scratch on a stick, or a knot in a cord. So the thesis is about having some symbolic token-practice, not about language specifically. It is supported by converging evidence from Nicaraguan homesigners, numerate adults under verbal interference, and cross-linguistic numeral gradients. We make no causal, acquisition, or neural claim; the identification is constitutive.

Explore related subjects

Keep this discovery

BibTeXRIS

Subrata Pal. 2026-07-07. The Pirah\~a and the cognitive gap in Frege's theorem: Hume's principle without the #. https://arxiv.org/abs/2607.05838

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO