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/Events/Conferences/newsitem/160
 98/18---19-July-2026-LCC-2026-–-16th-Intl-Workshop
 -on-Logic-and-Computational-Complexity-Lisbon-PT-
DTSTAMP:20260305T100442
SUMMARY:LCC 2026 – 16th Intl. Workshop on Logic an
 d Computational Complexity, Lisbon [PT]
DTSTART;VALUE=DATE:20260718
DTEND;VALUE=DATE:20260719
LOCATION:Lisbon [PT]
DESCRIPTION:LCC meetings are aimed at the foundati
 onal interconnections between logic and computatio
 nal complexity, as present, for example, in implic
 it computational complexity (descriptive and type-
 theoretic methods); deductive formalisms as they r
 elate to complexity (e.g. ramification, weak compr
 ehension, bounded arithmetic, linear logic and res
 ource logics); complexity aspects of finite model 
 theory and databases; complexity-mindful program d
 erivation and verification; computational complexi
 ty at higher type; and proof complexity.   This ye
 ar's edition is a part of the Federated Logic Conf
 erence FLoC’26.  LCC meetings are aimed at the fou
 ndational interconnections between logic and compu
 tational complexity.  Welcomed are submissions of 
 abstracts based on work which may be submitted or 
 published elsewhere, provided that all pertinent i
 nformation is disclosed at submission time. There 
 will be no formal reviewing as is usually understo
 od in peer-reviewed conferences with published pro
 ceedings. The program committee checks relevance a
 nd may provide additional feedback.
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>LCC meeti
 ngs are aimed at the foundational interconnections
  between logic and computational complexity, as pr
 esent, for example, in implicit computational comp
 lexity (descriptive and type-theoretic methods); d
 eductive formalisms as they relate to complexity (
 e.g. ramification, weak comprehension, bounded ari
 thmetic, linear logic and resource logics); comple
 xity aspects of finite model theory and databases;
  complexity-mindful program derivation and verific
 ation; computational complexity at higher type; an
 d proof complexity.&nbsp;</p>\n  <p>This year's ed
 ition is a part of the Federated Logic Conference&
 nbsp;<a href="https://www.floc26.org/"><strong>FLo
 C’26</strong></a>.</p>\n</div><div>\n  <p>LCC meet
 ings are aimed at the foundational interconnection
 s between logic and computational complexity.</p>\
 n  <p>Welcomed are submissions of abstracts based 
 on work which may be submitted or published elsewh
 ere, provided that all pertinent information is di
 sclosed at submission time. There will be no forma
 l reviewing as is usually understood in peer-revie
 wed conferences with published proceedings. The pr
 ogram committee checks relevance and may provide a
 dditional feedback.</p>\n</div>
URL:https://webusers.imj-prg.fr/~arnaud.durand/LCC
 /lcc26.html
END:VEVENT
END:VCALENDAR