Paperlane

no. 16 · Tuesday 17 November 2026

Pointwise provable equality and the failure of composition

Florian Lengyel

math.LO · v3 · □ lean · 11 pp

Abstract

In their studies of pathologies in recursion categories, Montagna (1989) and Di Paola–Montagna (1991) introduce the algebraic systems $S'$ and $S'_T$, respectively, and claim that they are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two unary programs whose partial functions are provably equal in $T$, separately at each standard input. Composing each after a program that searches for a $T$-proof of contradiction and returns its code yields programs that are not equivalent in this sense. An alternative proof uses the productivity of the complement of the diagonal halting set. Montagna's $S'$ is the case $T=\mathrm{PA}$. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

comments
11 pages. Minor expository revisions: removed repetition and clarified invariance of domain partial identities and R-totality under pointwise provable equality. Results, existing proofs, and Lean formalization unchanged. Registered Lean formalization: https://palomar-registry.org/entry?id=PALOMAR-2026-10-01-000013&version=1
fields
Logic
pdf ↗ page arXiv:2609.25556 ↗