BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1067
DTSTAMP:20230914T125949Z
SUMMARY:Theory of Field $\\mathbb{C} $ is Decidable
DESCRIPTION:Speaker: Prabhat Kumar Jha\n\nAbstract: \nZoom Details:\nLink: 
 https://zoom.us/j/98172222418?pwd=b0htSDQ5NDRKQ050K0d6cHJ3YnZXQT09\nMeetin
 g ID: 981 7222 2418\nPassword: studsem\nAbstract:  Many optimization pro
 blems reduce to finding truth value of quantified formulas over real or/an
 d complex numbers. In this talk we will cover a proof of decidability of t
 heories of real numbers and complex numbers due to Tarski. We will begin b
 y providing an algorithm to locate roots of multi-variable polynomials ove
 r these fields and then use quantifier elimination techniques to prove dec
 idability. If time permits\, we will discuss its applications to optimizat
 ion and verification problems.\nNote: There is no prerequisite from Mathem
 atical Logic or Computability theory.\n
URL:https://www.tcs.tifr.res.in/web/events/1067
DTSTART;TZID=Asia/Kolkata:20200704T160000
DTEND;TZID=Asia/Kolkata:20200704T170000
END:VEVENT
END:VCALENDAR