23.3 Higher recursion

H_n(phi) contains all +H_k(phi) and all -I_k(phi) for k<n

I_n(phi) contains all +I_k(phi) and all -H_k(phi) for k<n

Typed negatives do not collapse to their positive opposites. Each recursive order has an independent type-symbol tau; a state is equal to another only when all primitive components and signed recursive-coordinate occupancies match. Therefore H_n != H_m and I_n != I_m whenever n != m.