Infinite-domain CSP dichotomy conjecture
Statement
Let be a first-order reduct of a finitely bounded homogeneous structure in a finite relational signature. The constraint satisfaction problem asks whether a finite input structure admits a homomorphism to . Infinite-domain CSP dichotomy conjecture. The problem is either in or is -complete. This extends the finite-domain CSP dichotomy to the indicated class of infinite-domain templates; the source presents it as open and attributes it to earlier work.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.