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/2015/newsitem/6193/23- 24-May-2015-Fourteenth-International-Workshop-on-P roof-Computation-and-Complexity-PCC-2015-Oslo-Norw ay DTSTAMP:20150129T000000 SUMMARY:Fourteenth International Workshop on Proof , Computation and Complexity (PCC 2015), Oslo, Nor way DTSTART;VALUE=DATE:20150523 DTEND;VALUE=DATE:20150524 LOCATION:Oslo, Norway DESCRIPTION:The aim of PCC is to stimulate researc h in proof theory, computation, and complexity, fo cusing on issues which combine logical and computa tional aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of in terest are (non-exhaustively listed) foundations f or specification and programming languages, logica l methods in specification and program development including program extraction from proofs, type th eory, new developments in structural proof theory, and implicit computational complexity. For mor e information, see http://www.mn.uio.no/math/engli sh/research/groups/logic/events/conferences/. P CC is intended to be a lively forum for presenting and discussing recent work. We solicit contributi ons in the fields of PCC, non-exhaustively describ ed above. Progress on a not yet satisfactorily sol ved problem may well be worth presenting - in part icular if the discussions during the workshop migh t lead towards a solution. Deadline for proposing a contributed talk: April 1, 2015. X-ALT-DESC;FMTTYPE=text/html:
\n The aim of PCC is to stimulate research in pr oof theory,\n computation, and complexity, focusing on issues which combine\n logical and computational aspects. Topics may include\n applications of formal inference systems in c omputer science,\n as well as new developme nts in proof theory motivated by\n computer science demands. Specific areas of interest are\n (non-exhaustively listed) foundations for specification and\n programming languages, logical methods in specification and\n prog ram development including program extraction from proofs,\n type theory, new developments in structural proof theory, and\n implicit com putational complexity.\n
\n \n \n\n For more information, see\n http://www.mn.uio.no/math/english/re search/groups/logic/events/conferences/.\n
\n PCC is inten ded to be a lively forum for presenting and\n discussing recent work. We solicit contribution s in the fields\n of PCC, non-exhaustively described above. Progress on a not yet satisfactor ily solved problem may well be worth presenting - in particular if the discussions during the worksh op might lead towards a solution. Deadline for\n proposing a contributed talk: April 1, 2015. \n
\n