From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.5 required=5.0 tests=DNS_FROM_RFC_ABUSE autolearn=disabled version=3.1.3 Received: from mail2-relais-roc.national.inria.fr (mail2-relais-roc.national.inria.fr [192.134.164.83]) by yquem.inria.fr (Postfix) with ESMTP id 1F58CBC37 for ; Sat, 4 Jul 2009 03:12:04 +0200 (CEST) X-IronPort-Anti-Spam-Filtered: true X-IronPort-Anti-Spam-Result: AgAEAAJJTkqBT/cEi2dsb2JhbACOdQGKHQEBAQoLChqjaoZQiE2EEgWBOg X-IronPort-AV: E=Sophos;i="4.42,345,1243807200"; d="scan'208";a="29246706" Received: from newman.cs.indiana.edu ([129.79.247.4]) by mail2-smtp-roc.national.inria.fr with ESMTP/TLS/DHE-RSA-AES256-SHA; 04 Jul 2009 03:12:03 +0200 Received: from tank.cs.indiana.edu (tank.cs.indiana.edu [129.79.247.109]) by newman.cs.indiana.edu (8.13.1/8.13.1/IUCS_2.87) with ESMTP id n641C0m7032038 for ; Fri, 3 Jul 2009 21:12:01 -0400 Received: from tank.cs.indiana.edu (localhost [127.0.0.1]) by tank.cs.indiana.edu (8.13.8/8.13.8/NULLCLIENT_1.5) with ESMTP id n641C0i0030938 for ; Fri, 3 Jul 2009 21:12:00 -0400 Received: (from lcc@localhost) by tank.cs.indiana.edu (8.13.8/8.13.8/Submit) id n641C0Vl030912 for caml-list@inria.fr; Fri, 3 Jul 2009 21:12:00 -0400 Date: Fri, 3 Jul 2009 21:12:00 -0400 From: Logic and Computational Complexity Message-Id: <200907040112.n641C0Vl030912@tank.cs.indiana.edu> To: caml-list@inria.fr Subject: LCC Call for Participation X-Spam: no; 0.00; lics:01 lics:01 bounded:01 logics:01 model:01 derivation:01 markus:01 catalunya:01 lauri:01 jean-yves:01 darmstadt:01 10,:98 michel:01 arithmetic:01 steering:01 [ Please broadcast/post/forward. Apologies for duplicates] LCC'09 CALL FOR PARTICIPATION The Tenth International Workshop on Logic and Computational Complexity (LCC'09, www.cs.indiana.edu/lcc) will be held in Los Angeles on August 10, 2009, as an affiliated meeting of LiCS'09 (www2.informatik.hu-berlin.de/lics/lics09), and in conjunction with SAS'09 (sas09.cs.ucdavis.edu). 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 LCC'09 program consists of invited lectures by Andrei Bulatov, Martin Hofmann, Phokion Kolaitis, Lars Kristiansen, and Michel de Rougemont, as well as contributed papers. The full program is available at www.cs.indiana.edu/lcc/09program.pdf. For additional information see www.cs.indiana.edu/lcc, or email inquiries to lcc@cs.indiana.edu. Further information about previous LCC meetings can be found at http://www.cis.syr.edu/~royer/lcc. PROGRAM COMMITTEE * Patrick Baillot (CNRS-ENS Lyons, Co-chair) * Markus Lohrey (Leipzig, Co-Chair) * Albert Atserias (UP de Catalunya) * Pablo Barcelo (U de Chile) * Arnold Beckmann (Swansea) * Lauri Hella (Tampere) * Andrei Krokhin (Durham) * Chris Pollett (San Jose SU) STEERING COMMITTEE: Michael Benedikt (Oxford, Co-chair), Daniel Leivant (Indiana U, Co-chair), Robert Constable (Cornell), Anuj Dawar (Cambridge), Fernando Ferreira (Lisbon), Martin Hofmann (U Munich), Neil Immerman (U Mass. Amherst), Neil Jones (Copenhagen), Bruce Kapron (U Victoria), Jean-Yves Marion (LORIA Nancy), Luke Ong (Oxford), Martin Otto (Darmstadt), James Royer (Syracuse), Helmut Schwichtenberg (U Munich), and Pawel Urzyczyn (Warsaw)