\n

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.

\n\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.\n
URL:http://www.cs.swansea.ac.uk/lcc/
CONTACT:lcc22 at easychair.org
END:VEVENT
END:VCALENDAR