Logic and Computational Complexity

LCC'18 MEETING

The Nineteenth International Workshop on Logic and Computational Complexity will be held in Oxford, UK, on July 13, 2018, as part of FLoC 2018 .

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.

IMPORTANT DATES

INVITED SPEAKERS

• Mikolaj Bojanczyk, University of Warsaw
• Ugo Dal Lago, University of Bologna and INRIA Sophia Antipolis

PROGRAM CHAIRS

• Erich Grädel (RWTH Aachen University, Germany)
• Jan Hoffmann (Carnegie Mellon University, Pittsburgh, USA)

PROGRAM COMMITTEE

• Albert Atserias (Universitat Politècnica de Catalunya)
• Antonina Kolokolova (Memorial University of Newfoundland)
• Damiano Mazza (CNRS - Université Paris 13)
• Wied Pakusa (Univeristy of Oxford)
• Simona Ronchi Della Rocca (Università di Torino)
• Ulrich Schöpp (LMU München)

SUBMISSION OF PAPERS

We welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback.

Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at:

https://easychair.org/conferences/?conf=lcc18

CONTACT