Features of the Abstract Predecessor Tree

-- This is a tree whose nodes are infinite sets of --not individual-- odd integers.

-- The root is the set of odd integers {5[8]}, i.e the extensions.

-- Every node divides into 3 subsets, {0, 1, or 2}[3].

-- Each subset produces its 3 distinct child sets (resp. leaves, b-steps, s-steps).

-- Each child set is in its turn an infinite set of odd integers also divisible into
     subsets, {0, 1, or 2}[3].

-- An infinite predecessor tree results from recursive application of the tree growth process.

next slide             return to slide index