Open Access
Translator Disclaimer
January 1998 - April 2000 The internal consistency of arithmetic with infinite descent
Yvon Gauthier
Mod. Log. 8(1-2): 47-87 (January 1998 - April 2000).


The consistency of arithmetic is shown to obtain without the recourse of transfinite induction or the detour of an infinite set. Arithmetic without an induction postulate, but with infinite descent, is Fermat Arithmetic coupled with Kronecker's "general arithmetic" of indeterminates. Fermat arithmetic is self-consistent or self-contained. The main idea is to interpret a local (constructive) logic with a local "effinite" quantifier in a polynomial translation and show how logic is eliminated by infinite descent in the same way as the content is exhausted in the decomposition of polynomials (or forms) where the method of infinite descent is at work. The arithmetization of logic (and the topological interpretation) is effected through the (combinatorial) convolution product of polynomials and amounts to a parametrization of logic by polynomials with indeterminates. Although not always effective, infinite descent provides a finite constructivist setting for an arithmetic that encompasses most of number theory and a large part of algebraic or arithmetic geometry. The resulting arithmetical logic can be seen as a vindication of Kronecker's foundational outlook beyond Hilbert's programme.


Download Citation

Yvon Gauthier. "The internal consistency of arithmetic with infinite descent." Mod. Log. 8 (1-2) 47 - 87, January 1998 - April 2000.


Published: January 1998 - April 2000
First available in Project Euclid: 13 April 2004

zbMATH: 0998.03044
MathSciNet: MR1834717

Primary: 03F30

Rights: Copyright © 2000 The Review of Modern Logic


Vol.8 • No. 1-2 • January 1998 - April 2000
Back to Top