BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
BEGIN:VEVENT
UID:/NewsandEvents/Events/Upcoming-Events/newsitem
/1096/1-December-2005-Uniform-Interpolation-in-Mod
al-Logics-Marta-Bilkova
DTSTAMP:20051124T000000
SUMMARY:Uniform Interpolation in Modal Logics\n
, Marta Bilkova
ATTENDEE;ROLE=Speaker:Marta Bilkova\n (Math.I
nst., Czech Acad.Sc.)
DTSTART:20051201T151500
DTEND:20051201T170000
LOCATION:Room P.327, Euclides building, Plantage M
uidergracht 24, Amsterdam
DESCRIPTION:We investigate uniform interpolants in
propositional modal logics from the proof-theoret
ical point of view. Our approach is adopted from P
itts' proof of uniform interpolation in intuitioni
stic propositional logic. The method is based on a
simulation of certain quantifiers ranging over pr
opositional variables and uses a terminating seque
nt calculus for which structural rules are admissi
ble. We can present such a proof of the uniform in
terpolation theorem for normal modal logics K, T,
GL, S4Grz and K4Grz. It provides an explicit algor
ithm constructing the interpolants. For more inf
ormation, contact Yde Venema at yde at science.uva
.nl.
X-ALT-DESC;FMTTYPE=text/html:\n \n
We investigate uniform interpolants in proposition
al modal\n logics from the proof-theoretica
l point of view. Our approach\n is adopted
from Pitts' proof of uniform interpolation in\n
intuitionistic propositional logic. The metho
d is based on a\n simulation of certain qua
ntifiers ranging over propositional\n varia
bles and uses a terminating sequent calculus for w
hich\n structural rules are admissible. We
can present such a proof\n of the uniform i
nterpolation theorem for normal modal logics K,\n
T, GL, S4Grz and K4Grz. It provides an expl
icit algorithm\n constructing the interpola
nts.\n

\n \n For more informat
ion, contact Yde Venema at\n yde at science.uva.nl.\n

\n
URL:/NewsandEvents/Events/Upcoming-Events/newsitem
/1096/1-December-2005-Uniform-Interpolation-in-Mod
al-Logics-Marta-Bilkova
END:VEVENT
END:VCALENDAR