Well-founded subterm relation on trees

Consider a type of binary trees where the nodes are labeled with an arbitrary type A:Set and define the relation "t is the left or right subtree of t'" Show that this relation is well-founded.


Follow this link

Going home
Yves Bertot
Last modified: Wed May 14 17:52:42 MEST 2003