\n

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

\nThe 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érée\n ( Darmstadt), Yevgeny Kazakov (Ulm) and Emanuel Kier onski\n (Wroclaw).\n

\n \n \ nFor more information, see\n h ttp://lcc2016.cs.unibo.it/\n

\n\n

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
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

\n