BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Indistinguishability in Counting Logics and the Complexity of Semi
 -Algebraic Proofs - Atserias\, A (Universitat Politcnica de Catalunya)
DTSTART:20120327T080000Z
DTEND:20120327T090000Z
UID:TALK37196@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:The recent connection between the concept of indistinguishabil
 ity by the properties expressible in a certain formal language and a relax
 ation of structural isomorphism through linear programming brings the area
 s of descriptive complexity and propositional proof complexity a little bi
 t closer together. In this talk I will overview this connection making emp
 hasis on the questions it has answered\, but also on the many new exciting
  questions that it raises.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR