Revision as of 23:12, 10 August 2003 edit Wshun (talk \| contribs) Extended confirmed users 2,335 edits move from Talk:mathematical induction ← Previous edit		Revision as of 22:37, 17 October 2003 edit undo Onebyone (talk \| contribs) Extended confirmed users 1,923 edits m Tinker with first sentence Next edit →
Line 1: ~~Principle~~The principle of [[mathematical induction]] can be proved if the following [[axiom]] is ~~needed~~assumed: :The set of all natural numbers is [[well-ordered]] (that is, every non-empty set of natural numbers has a least element). A simplified version is given here. This proof does not use the standard mathematical symbols for '''there exists''' and '''for all''' to make it more accessible to less mathematically motivated readers. The key technique is [[natural deduction logic]] and [[proof by contradiction]].

Proof of mathematical induction: Difference between revisions