The Principle of Green Tree Induction

Consider a tree structure.  We have a base node and out of each node is one or more baby nodes.

1) Base node is green.

2) At each node, green transfers to each baby node.

then

All nodes are green.

Green can mean a node is a member of a set or some condition is true at the node or something is defined at the node.

Green transfers to each baby node, means that if the node satisfies some condition, then each baby node coming out of that node satisfies the condition. The condition can contain the node index or other information.

If the condition contains the entire path traveled, we can modify this to a path induction principle.

1) Base node is green.

2) At each node, green transfers along each path to each path including each baby node.

Then

All paths through the tree are green.

Advertisements

About New Math Done Right

Author of Pre-Algebra New Math Done Right Peano Axioms. A below college level self study book on the Peano Axioms and proofs of the associative and commutative laws of addition. President of Mathematical Finance Company. Provides economic scenario generators to financial institutions.
This entry was posted in Uncategorized. Bookmark the permalink.

3 Responses to The Principle of Green Tree Induction

  1. Pingback: The Principle of Tweet Induction | New Math Done Right

  2. Pingback: Virginia Standards of Learning Kindergarten v Peano Axioms | New Math Done Right

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s