Structural induction is a proof method applied to mathematical logic, computer science, graph theory and other mathematical fields (such as the proof of Roth theorem). This is a special mathematical induction.
Usually he is used to prove some propositions P (x), which is one of some recursively defined structures (such as trees and tables). A well-based partial order is defined on this structure. The proof of structural induction is to prove that the proposition is true for all minimal structures. If he is established in the basic structure S of a structure, then he must also establish these components in the whole S. For example, if a structure is such a table, as long as table L is at the end of table M, then L.
Prove that P([]) holds.
If P(L) holds in table L, if L is the bottom of table M, then P(M) also holds.