[Proof Complexity] LCC 2014/ImmermanFest: Call for Participation

Arnold Beckmann a.beckmann at swansea.ac.uk
Wed Jun 4 12:06:24 CEST 2014

[Please broadcast/post/forward.   Apologies for duplicates]

July 12-13, 2014  (part of FLoC'14 and Vienna Summer of Logic)


   Early registration deadline:           June 8th, 2014 
   Student support:  For USA-based students/post-docs substantial
     NSF funding remains to support workshop attendance/travel;
     allocated on a first-come first-considered basis.

The Fifteenth International Workshop on Logic and Computational 
Complexity and Workshop in Honor of Neil Immerman's 60th Birthday 
(LCC 2014/ImmermanFest, http://www.cs.swansea.ac.uk/lcc2014/) 
will be held in Vienna, Austria, on July 12-13, 2014, as an 
affiliated meeting of the Vienna Summer of Logic.  The LCC 
2014/ImmermanFest program will consist of a first day (July 12th) 
of talks which include both invited lectures as well as 
contributed talks selected by the program committee, and a second 
day (July 13th) devoted entirely to invited talks in celebration 
of Neil Immerman's 60th birthday.

The invited talks for day one of LCC 2014 are:

    * Sam Buss (University of California, San Diego):
         Title: "Search problems, proof complexity, and
                 second-order bounded arithmetic."
    * Georg Moser (University of Innsbruck):
         Title: "Weighted automata theory for complexity analysis
                 of rewrite systems."

The invited talks for ImmermanFest (day two) are:

    * Eric Allender (Rutgers):
         Title: "27 and still counting: Iterated product,
                 inductive counting, and the structure of P."
    * Anuj Dawar (University of Cambridge):
         Title: "On the power of fixed-point logic with counting."
    * Phokion Kolaitis (University of California, Santa Cruz)
         Title: "Some reflections on definability and complexity."
    * Benjamin Rossman (National Institute of Informatics, Tokyo)
         Title: "The variable hierarchy on ordered graphs."
    * Mooly Sagiv (Tel Aviv University)
         Title: "Reasoning about transitive closure in Immerman's
    * Nicole Schweikardt (Goethe University Frankfurt am Main)
         Title: "Crane Beach Revisited."

The preliminary programme of the workshop is available at

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 

Neil Immerman has made numerous fundamental and inspiring 
contributions to the connections between logic and complexity. 
In particular, he has been one of the leading figures in the 
development of descriptive complexity, which has elucidated 
intimate and beautiful connections between complexity theory and 
finite model theory.  This year, day two of LCC 2014 will honor 
Neil's 60th birthday with a series of invited lectures by some of 
the leading researchers working in areas that have been 
influenced by Neil's work.


We have secured funding from various sources for student/postdoc 
participation at the LCC2014 / ImmermanFest Meeting.

NSF participation/travel Grants for USA-based student/postdoc 
attendance: A large grant from the National Science Foundation is 
available to support workshop attendance/travel for USA-based PhD 
students and postdocs working in an area related to the LCC2014 / 
ImmermanFest Meeting. They can cover registration-only, 
registration and accommodation, or registration, accommodation 
and travel (up to a maximal amount of $2,000). For information on 
eligibility and the procedure for applying for this funding, 

DLMPS Grants:  A small number of student/postdoc grants, funded 
by the Division of Logic, Methodology and Philosophy of Science, 
were available, but have now been fully allocated.

Note that FloC'14 offers additional possibilities for student 
travel support: http://vsl2014.at/floc14-travel-support/
Any funds that we provide for student attendance/travel for 
LCC'14/ImmermanFest can be use in combination with other funding 
obtained from FloC'14 to attend other events at FloC'14.


    * Arnold Beckmann (Swansea University, co-chair)
    * Ulrich Berger (Swansea University)
    * Olaf Beyersdorff (University of Leeds)
    * Yijia Chen (Shanghai Jiao Tong University)
    * Anuj Dawar (University of Cambridge)
    * Kousha Etessami (University of Edinburgh, co-chair)
    * Martin Grohe (RWTH Aachen)
    * Martin Hofmann (LMU Munich)
    * Leszek Kolodziejczyk (University of Warsaw)
    * Stephan Kreutzer (Technical University Berlin)
    * Mooly Sagiv (Tel Aviv University)
    * Shlomo Zilberstein (University of Massachusetts, Amherst)


Michael Benedikt (Oxford), Ulrich Berger (Swansea, co-chair), 
Robert Constable (Cornell) Anuj Dawar (Cambridge, co-chair), 
Arnaud Durand, Fernando Ferreira (Lisbon), Joerg Flum, Martin 
Hofmann (U Munich), Neil Jones (Copenhagen), Daniel Leivant 
(Indiana U), Jean-Yves Marion (LORIA Nancy), Simone Martini, 
Yannis Moschovakis (UCLA), Isabel Oitavem, Luke Ong (Oxford), 
James Royer (Syracuse), Helmut Schwichtenberg (U Munich)

More information about the Proof-Complexity mailing list