Decidability of MSO Reparameterization over Countable Chains

Interpretations are a fundamental tool in mathematical logic, allowing structures to be encoded within other structures via logical definitions. We study MSOmultidimensional point interpretations, where elements of an interpreted structure are represented by tuples of elements of the host structure, and address the problem of simplifying such interpretations by reducing their representation dimension. To formalize simplification, we use the notion of reparameterization. Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a given MSO formula admits a d-dimensional reparameterization. As a consequence, every interpretation whose domain admits such a reparameterization is equivalent to a d-dimensional point interpretation.