Logic Seminar Abstracts

	Logic Seminar Abstracts
	Title: Introduction to Constraint Satisfaction over infinite structures Speaker: Michael Pinsker Affiliation: Université Diderot - Paris 7 Time: 2pm, Tuesday, April 29 Location: Math 220 Abstract: The Constraint Satisfaction Problem (CSP) of a finite or countable first-order structure S in a finite relational language is the problem of deciding whether a given conjunction of atomic formulas in that language is satisfiable in S. Many classical computational problems can be modelled this way. The study of CSPs involves an interesting combination of techniques from universal algebra, Ramsey theory, and model theory. This talk will present an overview over these techniques as well as some wild conjectures.
	\| Logic Seminar Main Page \| CU Math Home \|