A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
We produce a class of ω-categorical structures with finite signature by applying a model-theoretic construction – a refinement of the Hrushosvki-encoding – to ω-categorical structures in a possibly infinite signature. We show that the encoded structures retain desirable algebraic properties of the original structures, but that the constraint satisfaction problems (CSPs) associated with these structures can be badly behaved in terms of computational complexity. This method allows us toarXiv:2002.07054v2 fatcat:7gjieagt2rdthb7imxs535e3a4