[Last update on Thursday, 27-Jun-2013 13:05:28 CEST ]

Preliminary programme


Sunday, September 1st

18.00 - 19.00

Welcome talk: Piergiorgio Odifreddi. The (almost pointless) finite geometries.

19.00 - 19.30

Aperitif.


Monday, September 2nd

9,00 - 9.25

Registration.

9.25 - 9.30

Opening.

9.30 - 10.30

Invited talk: Jean Yves Girard. Three lightings of logic.

10.30 - 10.55

Paul-Andre Mellies. On dialogue games and coherent strategies.

10.55 - 11.20

Coffee break.

11.20 - 11.45

Susumu Nishimura. A Full Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables.

11.45 - 12.10

Pietro Di Gianantonio and Marina Lenisa. Innocent Game Semantics via Intersection Type Assignment Systems.

12.10 - 12.35

Pierre Boudes, Fanny He and Michele Pagani. A characterization of the Taylor expansion of lambda-terms.

12.35 - 13.00

Ranald Clouston, Rajeev Goré and Alwen Tiu. Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic.

13.00 - 14.30

Lunch.

14,30 - 14.55

Richard Statman. A new type assignment for strongly normalizable terms.

14.55 - 15.20

Kentaro Kikuchi. Proving Strong Normalisation via Non-deterministic Translations into Klop's Extended lambda-Calculus.

15.20 - 15.45

Federico Aschieri, Stefano Berardi and Giovanni Birolo. Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1.

15.45 - 16.10

Lionel Rieg. Extracting Herbrand trees in classical realizability using forcing.

16.10 - 16.30

Coffee break.

16.30 - 16.55

Yoshihiro Maruyama. Categorical Duality Theory: Domains, Convexity, and the Distribution Monad.

16.55 - 17.20

Dexter Kozen and Konstantinos Mamouras. Typed Kleene Algebra with Products and Iteration Theories.

17.20 - 17.45

Qian Wang and Bruno Barras. Semantics of Intensional Type Theory extended with Decidable Equational Theories.


Tuesday, September 3rd

9,00 - 10.00

Invited talk: Lidia Tendera. Means and limits of decision.

10.00 - 10.25

Amaldev Manuel and Thomas Zeume. Two-Variable Logic on 2-Dimensional Structures.

10.25 - 10.50

Pietro Galliani, Miika Hannula and Juha Kontinen. Hierarchies in independence logic.

10.50 - 11.20

Coffee break.

11.20 - 11.45

Pietro Galliani and Lauri Hella. Inclusion Logic and Fixed Point Logic.

11.45 - 12.10

Frederik Harwath and Nicole Schweikardt. On the locality of arb-invariant first-order logic with modulo counting quantifiers.

12.10 - 12.35

Christopher Hampson and Agi Kurucz. One-variable first-order linear temporal logics with counting.

12.35 - 13.00

Jakub Michaliszyn and Jan Otop. Elementary Modal Logics over Transitive Structures.

13.00 - 14.30

Lunch.

14.30 - 14.55

Antti Kuusisto. Modal Logic and Distributed Message Passing Automata.

14.55 - 15.20

Julian Bradfield. Team building in dependence.

15.20 - 15.45

Bahareh Afshari and Graham E. Leigh. Closure ordinals for the modal mu-calculus.

15.45 - 16.10

Paul Hunter. When is Metric Temporal Logic Expressively Complete?

16.10 - 16.30

Coffee break.


Ackermann Award

16.30 - 16.45

Laudatio.

16.45 - 17.45

Ackermann lecture.

18.00-19.00

Business meeting


20.30

Social dinner.


Wednesday, September 4th

9,00 - 10.00

Invited talk: Nachum Dershowitz. The Universal Model of Computation.

10.00 - 10.25

Stefan Göller. The Fixed-Parameter Tractability of Model Checking Concurrent Systems.

10.25 - 10.50

Christopher Broadbent and Naoki Kobayashi. Saturation-Based Model Checking of Higher-Order Recursion Schemes.

10.50 - 11.20

Coffee break.

11.20 - 11.45

Marek Materzok. Axiomatizing subtyped delimited continuations.

11.45 - 12.10

Neelakantan Krishnaswami and Derek Dreyer. Internalizing Relational Parametricity in the Extensional Calculus of Constructions.

12.10 - 12.35

Stéphane Gimenez and Georg Moser. The Structure of Interaction.

12.35 - 13.30

Lunch.

14.00 - 18.00

Excursion: visit at the Venaria castle.


Thursday, September 5th

9,00 - 10.00

Invited talk: Isabel Oitavem. From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace.

10.00 - 10.25

Daniel Leivant. Intrinsic theories for inductive and coinductive computing.

10.25 - 10.50

Kaveh Ghasemloo and Stephen Cook. Theories for Subexponential-size Bounded-depth Frege Proofs.

10.50 - 11.20

Coffee break.

11.20 - 11.45

Christoph Berkholz, Andreas Krebs and Oleg Verbitsky. Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy.

11.45 - 12.10

Victor Dalmau, Andrei Bulatov and Marc Thurley. Descriptive complexity of approximate counting CSPs.

12.10 - 12.35

Johannes Schmidt and Michał Wrona. The Complexity of Abduction for Equality Constraint Languages.

12.35 - 13.00

Krishnendu Chatterjee and Nathanaël Fijalkow. Infinite-state games with finitary conditions.

13.00 - 14.30

Lunch.

14.30 - 14.55

Jérôme Fortier and Luigi Santocanale. Cuts for circular proofs: semantics and elimination.

14.55 - 15.20

Marcin Bilkowski and Michał Skrzypczak. Unambiguity and uniformization problems on infinite trees.

15.20 - 15.45

Thomas Colcombet, Denis Kuperberg, Christof Löding and Michael Vanden Boom. Deciding the weak definability of Büchi definable tree languages.

15.45 - 16.10

Krishnendu Chatterjee, Martin Chmelík and Mathieu Tracol. What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives .