Abstract

SummaryFinite, or Fermat arithmetic, as we call it, differs from Peano arithmetic in that it does not involve the existence of an infinite set or Peano's induction postulate. Fermat's method of infinite descent takes the place of bound induction, and we show that a con‐structivist interpretation of logical connectives and quantifiers can account for the predicative finitary nature of Fermat's arithmetic. A non‐set‐theoretic arithemetical logic thus seems best suited to a constructivist‐inspired number theory