<logic> A method of proving statements about well-ordered sets. If S is a well-ordered set with ordering "<", and we want to show that a property P holds for every element of S, it is sufficient to show that, for all s in S,

IF for all t in S, t < s => P(t) THEN P(s)

I.e. if P holds for anything less than s then it holds for s. In this case we say P is proved by induction.

The most common instance of proof by induction is induction over the natural numbers where we prove that some property holds for n=0 and that if it holds for n, it holds for n+1.

(In fact it is sufficient for "<" to be a well-founded partial order on S, not necessarily a well-ordering of S.)

(01 Apr 1999)

This entry has no definition yet.

(14 Jan 2009)

induct, inductance, inducteous, induction < Prev | Next > induction, induction chemotherapy

Bookmark with: icon icon icon icon iconword visualiser Go and visit our forums Community Forums

The act or process of inducing or causing to occur, especially the production of a specific morphogenetic effect in the developing embryo through the influence of evocators or organisers or the production of anaesthesia or unconsciousness by use of appropriate agents.

Origin: L. Inductio

(11 Mar 2008)

inductance, inducteous, induction, induction < Prev | Next > induction chemotherapy, induction generator

Bookmark with: icon icon icon icon iconword visualiser Go and visit our forums Community Forums