[Home]History of Mathematical induction

HomePage | Recent Changes | Preferences

Revision 30 . . October 27, 2001 12:19 am by AxelBoldt
Revision 29 . . (edit) October 26, 2001 10:01 pm by Jan Hidders
  

Difference (from prior major revision) (no other diffs)

Changed: 60c60
This form of induction, when applied to ordinals (which form a well-ordered and hence well-founded set), is called transfinite induction. It is an important proof technique in set theory, topology and other fields.
This form of induction, when applied to ordinals (which form a well-ordered and hence well-founded class), is called transfinite induction. It is an important proof technique in set theory, topology and other fields.

HomePage | Recent Changes | Preferences
Search: