← 研踪 PaperTrailarXiv:2609.25556 · v3
Pointwise provable equality and the failure of composition
首次提交 2026-09-22 09:43
版本更新 2026-11-15 11:00
雷达观测 2026-11-17 19:15
摘要
In their studies of pathologies in recursion categories, Montagna (1989) and Di Paola--Montagna (1991) introduce the algebraic systems and , 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 of Peano arithmetic (), we exhibit two unary programs whose partial functions are provably equal in , separately at each standard input. Composing each after a program that searches for a -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 is the case . More generally, for consistent , pointwise provable equality is a composition congruence exactly when proves every true sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable by Gödel's second incompleteness theorem. For every extension , the least composition congruence containing pointwise provable equality is extensional equality if is -sound and the universal relation otherwise.
作者备注: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
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-15 11:00 · 最新观测版本
Pointwise provable equality and the failure of composition
In their studies of pathologies in recursion categories, Montagna (1989) and Di Paola--Montagna (1991) introduce the algebraic systems and , 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 of Peano arithmetic (), we exhibit two unary programs whose partial functions are provably equal in , separately at each standard input. Composing each after a program that searches for a -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 is the case . More generally, for consistent , pointwise provable equality is a composition congruence exactly when proves every true sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable by Gödel's second incompleteness theorem. For every extension , the least composition congruence containing pointwise provable equality is extensional equality if is -sound and the universal relation otherwise.
查看此版本解读 →查看此版本原文 ↗