BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2014/newsitem/6108/12-
December-2014-Colloquium-on-Mathematical-Logic-Jou
ko-Vaananen
DTSTAMP:20141211T000000
SUMMARY:Colloquium on Mathematical Logic, Jouko Va
ananen
ATTENDEE;ROLE=Speaker:Jouko Vaananen
DTSTART;TZID=Europe/Amsterdam:20141212T160000
DTEND;TZID=Europe/Amsterdam:20141212T170000
LOCATION:Drift 6, zaal 007, Utrecht
DESCRIPTION:A logical approach to Bell's Inequalit
ies of quantum mechanics has been introduced by Ab
ramsky and Hardy. We point out that these logical
Bell's Inequalities are provable in the probabilit
y logic of Fagin, Halpern and Megiddo. Since it is
now considered empirically established that quant
um mechanics violates Bell's Inequalities, we intr
oduce a modified probability logic, that we call q
uantum team logic, in which Bell's Inequalities ar
e not provable, and prove a Completeness Theorem f
or this logic. For this end we generalise the team
semantics of dependence logic first to probabilis
tic team semantics, and then to, what we call quan
tum team semantics. For abstracts and more inform
ation, see http://www.staff.science.uu.nl/~ooste11
0/seminar.html or contact Benno van den Berg (benn
ovdberg at gmail.com).
X-ALT-DESC;FMTTYPE=text/html:\n A logica
l approach to Bell's Inequalities of quantum mecha
nics has been introduced by Abramsky and Hardy. We
point out that these logical Bell's Inequalities
are provable in the probability logic of Fagin, Ha
lpern and Megiddo. Since it is now considered empi
rically established that quantum mechanics violate
s Bell's Inequalities, we introduce a modified pro
bability logic, that we call quantum team logic, i
n which Bell's Inequalities are not provable, and
prove a Completeness Theorem for this logic. For t
his end we generalise the team semantics of depend
ence logic first to probabilistic team semantics,
and then to, what we call quantum team semantics.<
/p>\n \n

For abstracts and more infor
mation, see http://w
ww.staff.science.uu.nl/~ooste110/seminar.html
or contact Benno van den Berg (be
nnovdberg at gmail.com
).

\n
URL:/NewsandEvents/Archives/2014/newsitem/6108/12-
December-2014-Colloquium-on-Mathematical-Logic-Jou
ko-Vaananen
END:VEVENT
END:VCALENDAR