Decidability of MSO Reparameterization over Countable Chains
Abstract
Interpretations are a fundamental tool in mathematical logic, allowing structures to be encoded within other structures via logical definitions. We study \emph{multidimensional 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 \emph{reparameterization}. Our main result shows that, over the class of countable labelled linear orders, it is decidable whether a given formula admits a -dimensional reparameterization. As a consequence, every interpretation whose domain admits such a reparameterization is equivalent to a -dimensional point interpretation.
Cite
@article{arxiv.2605.18248,
title = {Decidability of MSO Reparameterization over Countable Chains},
author = {Alexander Rabinovich},
journal= {arXiv preprint arXiv:2605.18248},
year = {2026}
}