![](/sites/default/files/styles/workshop_banner_sm_1x/public/logic_horizontal.png.jpg?itok=bl1RVreS)
Abstract
We study infinite CSPs defined by finitely many first-order formulas. We determine the decidability status of FO-definable CSP depending on whether the number of allowed types of constraints or/and number of tuples in each constraint are allowed to be infinite. This is joint work with Bartek Klin, Eryk Kopczynski, Slawek Lasota and Szymon Torunczyk.