2 problems

Let $\mathstrut M$ be a countable ultrahomogeneous structure in a finite relational language. A reduct of $\mathstrut M$ is a structure on the same domain whose relations and funct…

Thomas's conjecture. The structure $\Delta$ has only finitely many reducts up to first-order interdefinability.