Alex Spelten

Learn More
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree iteration of a relational structure M in the sense of ShelahStupp. In contrast to classical results, where(More)
  • 1