Jocelyn Quaintance 2026-11-05
The arithmetic chapter distinguishes the finite axioms of Robinson arithmetic from the mathematical induction schema used in Peano arithmetic. This matters computationally: a formal language can express arithmetic operations while different axiom systems prove different claims about them. The exposition connects symbolic rules with limits on what algorithms and formal proofs can establish.