MathDB1 problem
A well-founded tree is a prefix-closed set of finite sequences, and its order type is the ordinal order type used in the paper. A coloring of such a tree assigns each node one of t…
A well-founded tree is a prefix-closed set of finite sequences, and its order type is the ordinal order type used in the paper. A coloring of such a tree assigns each node one of t…