Logic Colloquium 2012 - Special Sessions

Philosophy of Mathematics and Computer Science (organiser: R. Turner)

• Leon Horsten (Bristol): Human effective computability (abstract | slides)
• Samson Abramsky (Oxford):
• Johan van Benthem (Amsterdam): Computation as social agency: what and how? (abstract)
• Giovanni Sambin (Padova): Two principles of dynamic constructivism (abstract | slides)

Computability, Logical and Physical (organiser: B. Cooper)

• Klaus Ambos-Spies (Heidelberg): On the strongly bounded Turing degrees of simple sets (abstract | slides)
• Vincent Danos (Edinburgh): Statistical physics of communicating processes (slides)
• Fay Dowker (Imperial College, London): Modus ponens in physics (abstract)
• Philip Welch (Bristol): Σ₃⁰-determinacy and transfinite Turing machine models (abstract)

Model Theory (organiser: M. Tressl)

• Elias Baro (Universidad Complutense de Madrid): From commutators to Cartan subgroups in the o-minimal setting (abstract | slides)
• Abderezak Ould Houcine (Université Claude Bernard Lyon 1): Algebraic closure and ampleness in free groups (abstract)
• Françoise Point (Université de Mons) Definable sets in topological differential fields (abstract)
• Pierre Simon (ENS Paris): Type decompositions in NIP theories (abstract | slides)

Homotopy Type Theory (organiser: S. Awodey)

• Peter Aczel (Manchester): The structure identity principle and the univalence axiom (abstract)
• Nicola Gambino (Palermo): Homotopy-initial W-types (abstract | slides)
• Martin Hyland (Cambridge): Identity and existence (abstract)
• Peter Lumsdaine (Dalhousie): A categorical road to intensional type theory (abstract)

Set Theory (organiser: U. Abraham)

• Mirna Dzamonja (East Anglia): Forcing axioms (abstract)
• David Asperó (Technische Universitaet, Wien): Ω-completeness and forcing axioms (abstract | slides)
• Dilip Raghavan (Kobe): Bounding, splitting, and almost disjointness (abstract)
• James Cummings (Carnegie Mellon): Infinitary methods in finite combinatorics (abstract)

Proof Theory (organiser: L. Beklemishev)

• Arnold Beckmann (Swansea): Feasible computation on general sets (abstract | slides)
• Thomas Strahm (Bern): Unfolding schematic formal systems: from non-finitist to feasible arithmetic (abstract | slides)
• Albert Visser (Utrecht): Provability logic and the arithmetics of a theory (abstract | slides)
• Stan Wainer (Leeds): A hierarchy of ramified theories "around" PRA (abstract | slides)