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/2016/newsitem/7272/2-3
 -September-2016-17th-International-Workshop-on-Log
 ic-Computational-Complexity-LCC-2016-Marseille-Fra
 nce
DTSTAMP:20160407T000000
SUMMARY:17th International Workshop on Logic & Com
 putational Complexity (LCC 2016), Marseille, Franc
 e
DTSTART;VALUE=DATE:20160902
DTEND;VALUE=DATE:20160903
LOCATION:Marseille, France
DESCRIPTION:LCC meetings are aimed at the foundati
 onal interconnections between logic and computatio
 nal complexity, as present, for example, in: impli
 cit computational complexity (descriptive and type
 -theoretic methods); deductive formalisms as they 
 relate to complexity (e.g. ramification, weak comp
 rehension, bounded arithmetic, linear logic and re
 source logics); complexity aspects of finite model
  theory and databases; complexity-mindful program 
 derivation and verification; computational complex
 ity at higher type; and proof complexity.   The pr
 ogramme will consist of invited lectures as well a
 s contributed talks selected by the Programme Comm
 ittee. Invited speakers: Anupam Das (Lyon), Hugo F
 érée (Darmstadt), Yevgeny Kazakov (Ulm) and Emanue
 l Kieronski (Wroclaw).   For more information, see
  http://lcc2016.cs.unibo.it/  We welcome submissio
 ns of abstracts based on work submitted or publish
 ed elsewhere, provided that all pertinent informat
 ion is disclosed at submission time. There will be
  no formal reviewing as is usually understood in p
 eer-reviewed conferences with published proceeding
 s. The Programme Committee will check relevance an
 d may provide additional feedback. Submission dead
 line: June 17th, 2016
X-ALT-DESC;FMTTYPE=text/html:<div>\n      <p>LCC m
 eetings are aimed at the foundational interconnect
 ions\n      between logic and computational comple
 xity, as present, for\n      example, in: implicit
  computational complexity (descriptive and\n      
 type-theoretic methods); deductive formalisms as t
 hey relate to\n      complexity (e.g. ramification
 , weak comprehension, bounded\n      arithmetic, l
 inear logic and resource logics); complexity\n    
   aspects of finite model theory and databases; co
 mplexity-mindful\n      program derivation and ver
 ification; computational complexity at\n      high
 er type; and proof complexity.\n      </p>\n      
 <p>The programme will consist of invited lectures 
 as well as\n      contributed talks selected by th
 e Programme Committee. Invited\n      speakers: An
 upam Das (Lyon), Hugo F&eacute;r&eacute;e\n      (
 Darmstadt), Yevgeny Kazakov (Ulm) and Emanuel Kier
 onski\n      (Wroclaw).\n      </p>\n    \n      \
 n      <p>For more information, see\n        <a ta
 rget="_blank" href="http://lcc2016.cs.unibo.it/">h
 ttp://lcc2016.cs.unibo.it/</a>\n      </p>\n    </
 div><div>\n      <p>We welcome submissions of abst
 racts based on work submitted\n      or published 
 elsewhere, provided that all pertinent information
 \n      is disclosed at submission time.  There wi
 ll be no formal\n      reviewing as is usually und
 erstood in peer-reviewed conferences\n      with p
 ublished proceedings.  The Programme Committee wil
 l check\n      relevance and may provide additiona
 l feedback.\n        Submission deadline: June 17t
 h, 2016\n      </p>\n      </div>
URL:/NewsandEvents/Archives/2016/newsitem/7272/2-3
 -September-2016-17th-International-Workshop-on-Log
 ic-Computational-Complexity-LCC-2016-Marseille-Fra
 nce
END:VEVENT
END:VCALENDAR