Eventual periodicity and ``one-dimensional'' queries
A generalization of the (finite version of the) Büchi-Ladner representation theorem for monadic second order Boolean queries on chainlike graphs is presented. A careful application of the monotonicity of one-dimensional least fixed point inductions results in the discovery that these inductions express fewer Boolean queries than even the monadic \(\Delta^ 1_ 1\) formulas.
scientific article; zbMATH DE number 120392