LC 2011 Logo

HOME

CONFERENCE VENUE

COMMITTEES

SCIENTIFIC PROGRAM

SCHEDULE

REGISTRATION

REGISTERED PARTICIPANTS

SOCIAL PROGRAM

LODGING

LOCAL INFORMATION

RELATED EVENTS

 Barcelona, Catalonia. July 11-16

Scientific program

Gödel lecture:

  • Anand Pillay (University of Leeds): First order theories (PDF)

Tutorials:

  • Georges Gonthier (Microsoft Research): Formal Verification
  • Martin Ziegler (Universität Freiburg): Model Theory: Hrushovski's amalgamation constructions (PDF, PS)

Plenary Speakers:

  • Steve Awodey (Carnegie Mellon University): Homotopy Type Theory (PDF)
  • George Barmpalias (Chinese Academy of Sciences Beijing): Chaitin's halting probability and the compression of strings using oracles (PDF)
  • Lev D. Beklemishev (Steklov Mathematical Institute): Topological semantics of provability logic
  • Raf Cluckers (Université Lille): New transfer principles for motivic integrals
  • Todd Eisworth (Ohio University): Coloring at successors of singulars
  • Sergey Goncharov (Russian Academy of Sciences): Problems of autostability and spectrum of autostability (PDF)
  • Henri Lombardi (Université de Franche-Comté): Constructive semantics for classical formal proofs (PDF)
  • Jordi López-Abad (ICMAT Madrid): Large cardinals and basic sequences (PDF)
  • Kenneth Manders (University of Pittsburgh):Strategies in the Philosophy of Mathematics
  • Martin Otto (Technische Universität Darmstadt): Tractable finite models
  • Jan Reimann (Penn State University): Dualities and Dichotomies in Algorithmic Information Theory (PDF)
  • Andrzej Rosłanowski (University of Nebraska): News of the Creature World - not only forcing (PDF)
  • Yde Venema (University of Amsterdam): A modal distributive law (PDF)

Special Sessions:

  • Computability Theory and Logic for Computer Science
    (organized by Albert Atserias and Rod Downey)
    • Laurent Bienvenu, Paris. E1: Randomness extraction: a computability perspective
    • Jörg Flum, Freiburg. E2: A halting problem and its consequences for logic and proof theory
    • Georg Gottlob, Oxford. E1: Tree-likeness, structural decompositions, and logical master theorems
    • Toniann Pitassi, Toronto. E2: Propositional Proof Complexity: The State of the Art and Some New Results

  • Foundations of Mathematics and Philosophy of Logic: Logic, Reasoning and Probability
    (organized by Johan van Benthem and Ian Pratt-Hartmann)
    • Hannes Leitgeb, Bristol. B1: The Logic of Belief: Qualitative vs. Quantitative
    • Jeff Paris, Manchester. B2: Pure Inductive Logic (PDF)
    • Sergei Artemov, New York. B2: A bimodal analysis of knowability (PDF)
    • Michiel van Lambalgen, Amsterdam. B1: Causality, probability and logic

  • Model Theory
    (organized by Enrique Casanovas and Kobi Peterzil)
    • Matthias Aschenbrenner, Los Angeles. C1: Vapnik-Chervonenkis density in model theory (PDF)
    • Ayhan Gunaydin, Lisboa. C1: Exponential polynomial equations
    • Itay Kaplan, Konstanz. C2: Directionality in NIP (PDF)
    • Alex Usvyatsov, Lisboa. C2: Various notion of smallness in dependent theories

  • Proof Theory and Constructive Mathematics
    (organized by Erik Palmgren and Michael Rathjen)
    • Josef Berger, Munich. D1: On Dickson's Lemma
    • Bas Spitters, Nijmegen. D1: Efficient real computation in constructive type theory (PDF)
    • Gunnar Wilken, Okinawa. D2: Derivation lenghts classification of Goedel's T as a prototype of higher order rewrite systems
    • Lev Gordeev, Tübingen. D2: Proof-theoretic conservations of weak weak intuitionistic constructive set theories (PDF)

  • Set Theory
    (organized by Joan Bagaria and Heike Mildenberger)
    • Lyubomyr Zdomskyy, Vienna. A1: On lifting elementary embeddings for strong cardinals
    • Luca Motto Ros, Freiburg. A2: The descriptive set theoretical complexity of the embeddability relation on uncountable models (PDF)
    • Andrew Brooke-Taylor, Bristol. A1: The limits of large cardinal compatibility for $\square$ (PDF)
    • Marcin Sabok, Wrocław. A2: Ramsey theory of Polish spaces (PDF)