Partition theorems for factorisations of ascending parameter words

Abstract

We prove, in primitive recursive arithmetic, an extension of a theorem established by Milliken and independently by Nešetřil and Rödl on partitions of fixed rank partitions of a finite set. In this way we depict the preservation of structure under partitions of the outcomes of substitution systems, which can also undergo various stage transitions.