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/2022/newsitem/13151/20
 -February-2022-22nd-International-Workshop-on-Logi
 c-and-Computational-Complexity-Online
DTSTAMP:20211111T172346
SUMMARY:22nd International Workshop on Logic and C
 omputational Complexity, Online
DTSTART;VALUE=DATE:20220220
DTEND;VALUE=DATE:20220220
LOCATION:Online
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. The progr
 am will consist of invited lectures as well as con
 tributed talks selected by the Program Committee. 
  Submissions must be in English and in the form of
  an abstract of about 3-4 pages. All submissions s
 hould be submitted through Easychair. We also welc
 ome submissions of abstracts based on work submitt
 ed or published elsewhere, provided that all perti
 nent information is disclosed at submission time. 
 There will be no formal reviewing as is usually un
 derstood in peer-reviewed conferences with publish
 ed proceedings. The program committee checks relev
 ance and 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. The program will consist of in
 vited lectures as well as contributed talks select
 ed by the Program Committee.</p>\n</div><div>\n  <
 p>Submissions must be in English and in the form o
 f an abstract of about 3-4 pages. All submissions 
 should be submitted through Easychair. We also wel
 come submissions of abstracts based on work submit
 ted or published elsewhere, provided that all pert
 inent information is disclosed at submission time.
  There will be no formal reviewing as is usually u
 nderstood in peer-reviewed conferences with publis
 hed proceedings. The program committee checks rele
 vance and may provide additional feedback.</p>\n</
 div>
URL:http://www.cs.swansea.ac.uk/lcc/
CONTACT:lcc22 at easychair.org
END:VEVENT
END:VCALENDAR