Shelah-Stupp’s Iteration and Muchnik’s Iteration

• Published in: Fundamenta informaticae Vol. 159; no. 4; pp. 327 - 359
• Main Authors: Caucal, Didier, Knapik, Teodor
• Format: Journal Article
• Language: English
• Published: London, England SAGE Publications 01.01.2018; IOS Press BV; Polskie Towarzystwo Matematyczne
• Subjects: Computer Science; Construction; Formal Languages and Automata Theory; Hierarchies; Iterative methods; Logic in Computer Science; Shelah-Stupp’s iteration; structure-building operations; Muchnik’s iteration; infinite-state systems; Shelah-Stupp's iteration; Muchnik's iteration
• ISSN: 0169-2968; 1875-8681
• DOI: 10.3233/FI-2018-1667

In the early seventies, Shelah proposed a model-theoretic construction, nowadays called “iteration”. This construction is an infinite replication in a tree-like manner where every vertex possesses its own copy of the original structure. Stupp proved that the decidability of the monadic second-order (MSO) theory is transferred from the original structure onto the iterated one. In its extended version discovered by Muchnik and introduced by Semenov, the iteration became popular in computer science logic thanks to a paper by Walukiewicz. Compared to the basic iteration, Muchnik’s iteration has an additional unary predicate which, in every copy, marks the vertex that is the clone of the possessor of the copy. A widely spread belief that this extension is crucial is formally confirmed in the paper. Two hierarchies of relational structures generated from finite structures by MSO interpretations and either Shelah-Stupp’s iteration or Muchnik’s iteration are compared. It turns out that the two hierarchies coincide at level 1. Every level of the latter hierarchy is closed under Shelah-Stupp’s interation. In particular, the former hierarchy collapses at level 1.