Fifteenth International Workshop on Logic and Computational Complexity
and Workshop in Honor of Neil Immerman's 60th Birthday
LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present in, for example: finite model theory and descriptive complexity; 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); logic and complexity-theoretic aspects of databases; complexity-mindful program verification and synthesis; computational complexity at higher type; and proof complexity.
The LCC 2014/ImmermanFest program will consist of a first day of talks which include invited lectures as well as contributed talks selected by the program committee (based on submitted abstracts), and a second day devoted to the celebration of Neil Immerman's 60th birthday, which will consist entirely of invited talks.
We will have a workshop dinner in honour of Immerman on the evening of the last day. The dinner is included in the workshop fee.
More information on LCC 2014/ImmermanFest can be found on the LCC 2014/ImmermanFest website.