BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Mixing finite and infinite structure - Michael Benedikt\, Universi
 ty of Oxford
DTSTART:20221010T150000Z
DTEND:20221010T160000Z
UID:TALK182999@talks.cam.ac.uk
CONTACT:Jamie Vicary
DESCRIPTION:A basic distinction between logic in databases and “vanilla 
 mathematical\nlogic” is that in the former quantifiers range over the ob
 jects that are\nstored in finite relations — stuff in the database\; whi
 le in the latter\nwe quantify over the domain of the model\, which can be 
 infinite -- all\nstrings\, all real numbers\, all integers\, etc. Once upo
 n a time\,\nresearchers studied what happens when you mix these two kinds 
 of\nquantification within the same logic. In the resulting formalism\,\n
 “embedded finite model theory”\, you can\, for example\, write a query
 \nasking whether there is a  vector of real numbers which satisfy certain\
 ninequalities with respect to all rows in a database table.\n\nThe talk wi
 ll revisit embedded finite model theory\, arguing that it’s\nrelevant to
  a number of recent develpments in data management\, such as\nperforming l
 inear algebra and ML tasks within a DBMS. The talk focus\nwill be on new c
 onnections to theoretical CS: spectrum problems\, bounds\nin decision proc
 edures\, and Ramsey theory.\n\nThere will be some classical model theory i
 n the lecture\, but it should\nbe accessible to a theory-leaning CS audien
 ce. The talk includes joint\nwork with Ehud Hrushovski and joint work with
  Anthony Lin.
LOCATION:SS03
END:VEVENT
END:VCALENDAR