Inductive Reasoning

Pronunciation: /ɪnˈdʌk tɪv ˈri zən ɪŋ/ ?

In inductive reasoning, a claim can be shown to be true for at least some instances, and is therefore assumed to be true for all cases. An example of inductive reasoning is:

This fire is hot, so all fires must be hot.

The problem with inductive reasoning in this case is that it does not prove absolutely that all fires are hot. A counter example is the false statement:

This apple is red, so all apples must be red.

Simple inductive reasoning is insufficient by itself for mathematical proof. However, proof by mathematical induction is a special case of inductive reasoning that can be used for proof.


  1. inductive reasoning. Encyclopedia Britannica. (Accessed: 2010-02-11). reasoning.
  2. Jevons, Stanley W.. Logic, pp 11. Science Primers. American Book Company. (Accessed: 2010-02-11).
  3. Hyslop, James H.. Logic and Argument, pp 185-191. Charles Scribner's Sons, 1899. (Accessed: 2010-02-11).
  4. Woolley, J.. An Introduction to Logic, pp 120-123. John Henry Parker, 1840. (Accessed: 2010-02-11).

More Information

  • McAdams, David. Induction. All Math Words Encyclopedia. Life is a Story Problem LLC. 2009-03-12.

Printed Resources

Cite this article as:

Inductive Reasoning. 2010-02-11. All Math Words Encyclopedia. Life is a Story Problem LLC.


Image Credits

Revision History

2010-02-11: Added "References" (McAdams, David.)
2008-08-11: Minor grammar changes (McAdams, David.)
2008-06-15: Added counter example. Changed 'proof by induction' to proof by 'mathematical induction' (McAdams, David.)
2007-09-03: Initial version (McAdams, David.)

All Math Words Encyclopedia is a service of Life is a Story Problem LLC.
Copyright © 2005-2011 Life is a Story Problem LLC. All rights reserved.
Creative Commons License This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 License