The program will consist of invited lectures as well as contributed papers selected by the Program Committee.

**Sponsor:**

LCC meetings are aimed at the foundational interconnections between logic and
computational complexity, as present, for example, in implicit computational
complexity (descriptive and type-theoretic methods); deductive formalisms
as they relate to complexity (e.g. ramification, weak comprehension,
bounded arithmetic, linear logic and resource logics); complexity aspects
of finite model theory and databases; complexity-mindful program derivation
and verification; computational complexity at higher type; and proof complexity.

The program will consist of invited lectures as well as contributed papers selected by the Program Committee.

**Sponsor:**

The program will consist of invited lectures as well as contributed papers selected by the Program Committee.