Paris-Vienna Workshop 2004 on Proof Systems

13 and 14 december 2004
175 rue du Chevaleret 75013 Paris

Monday Morning, Room 5C03

• 9:30-10:15 Chris Fermüller

  Revisiting Giles: On Bets, Dialogue Games, Fuzzy logics, and Hypersequents (abstract)

• 10:15-11:00 Agata Ciabattoni

  Automated Generation of Analytic Calculi for Logics with Linearity (abstract)

11:00-11:30 Break

• 11:30-12:15 Norbert Preining

  Gödel logics and Kripke frames (joint work with Arnold Beckmann) (abstract)

Monday Afternoon, Room 0D4

• 14:00-14:45 Arnold Beckmann

  Viewing proofs in bounded arithmetic as programs (abstract)

• 14:45:15:30 Olivier Laurent

  Polarized Proof-Nets (abstract)

15:30:16:00 Break

• 16:00-16:45 Stéphane Lengrand

  Explicit operators and proof-nets (abstract)

• 16:45-17:30 Alessio Gugliemi

  Reasons and methods of deep inference (abstract)

Tuesday Morning, Room 1C06

• 09:30-10:15 Kai Brünnler

  Deep Inference and Cut Elimination for Predicate Logic (abstract)

10:15-10:45 Break

Room 0D4

• 10:45-11:30 Alexander Leitsch

  CERES: Cut-Elimination by Resolution (abstract)

• 11:30-12:15 Clemens Richter

  The Cut-Elimination Program CERES (abstract)

Tuesday Afternoon, Room 0D4

• 14:00-14:45 Sebastian Terwijn

  Logic and probabilistic induction (abstract)

• 14:45:15:30 Michel Parigot

  On constructive existence (abstract)

15:30:16:00 Break

• 16:00-16:45 Matthias Baaz

  Skolem Functions: the hidden quantifier complexity of proofs (abstract)