- Matteo Acclavio - Combinatorial Proofs for Modal Logic K
- Juan P. Aguilera - Systems of determinacy in third-order arithmetic
- Andrea Aler-Tubella - What we learn from decomposition
- Federico Aschieri
- Matthias Baaz
- Kees van Berkel - Cut-free Calculi and Relational Semantics for temporal STIT logics
- Jan Bydzovsky - Unprovability of circuit upper bounds in the Cook's theory PV
- David Cerna - A Structural Semantics for Recursive Proof Calculi
- Agata Ciabattoni
- Gabriel Ebner - Herbrand constructivization for automated intuitionistic theorem proving
- Chris Fermüller - A cost conscious game model for intutionistic linear logic with subexponentials
- Francesco Genco - Intermediate Logic Proofs as Concurrent Programs
- Hugo Herbelin - tba
- Stefan Hetzl - A simplified proof of the epsilon-theorems
- Thierry Joly - Distilling sequent calculus yields Curry's combinatory factorization
- Delia Kesner - Refined Quantitative Type Systems
- Roman Kuznets - Nesting multi-conclusions: the Maehara conundrum
- Alexander Leitsch - Proof Schemata and Herbrand Systems
- Anela Lolic
- Sonia Marin - Justification logic for constructive modal logics
- George Metcalfe - Uniform Interpolation and Coherence
- Kenji Miyamoto - The epsilon calculus with equality and Herbrand complexity
- Georg Moser
- Michel Parigot
- Alexandra Pavlova
- Revantha Ramanayake - Sequent calculi for substructural logics via bounded proofs
- Dino Rossegger - The complexity of scattered linear orderings
- Lutz Straßburger - Proof Nets for First-Order Additive Linear Logic
- Jannik Vierling - Clause Set Cycles and Induction
- Simon Wolfsteiner

Friday 7 December 2018 | |
---|---|

9:00 - 10:00 | Alexander Leitsch - Proof Schemata and Herbrand Systems |

10:00 - 10:30 | break |

10:30 - 11:00 | Francesco Genco - Intermediate Logic Proofs as Concurrent Programs |

11:00 - 11:30 | Thierry Joly - Distilling sequent calculus yields Curry's combinatory factorization |

11:30 - 12:00 | Lutz Straßburger - Proof Nets for First-Order Additive Linear Logic |

12:00 - 14:00 | break |

14:00 - 14:30 | Hugo Herbelin - tba |

14:30 - 15:00 | Andrea Aler-Tubella - What we learn from decomposition |

15:00 - 15:30 | Matteo Acclavio - Combinatorial Proofs for Modal Logic K |

15:30 - 16:00 | break |

16:00 - 16:30 | Kees van Berkel - Cut-free Calculi and Relational Semantics for temporal STIT logics |

16:30 - 17:00 | Jan Bydzovsky - Unprovability of circuit upper bounds in the Cook's theory PV |

17:00 - 17:30 | Delia Kesner - Refined Quantitative Type Systems |

17:30 - 18:00 | Sonia Marin - Justification logic for constructive modal logics |

Saturday 8 December 2018 | |

9:00 - 10:00 | George Metcalfe - Uniform Interpolation and Coherence |

10:00 - 10:30 | break |

10:30 - 11:00 | Roman Kuznets - Nesting multi-conclusions: the Maehara conundrum |

11:00 - 11:30 | Chris Fermüller - A cost conscious game model for intutionistic linear logic with subexponentials |

11:30 - 12:00 | Revantha Ramanayake - Sequent calculi for substructural logics via bounded proofs |

12:00 - 14:00 | break |

14:00 - 14:30 | Stefan Hetzl - A simplified proof of the epsilon-theorems |

14:30 - 15:00 | Kenji Miyamoto - The epsilon calculus with equality and Herbrand complexity |

15:00 - 15:30 | Gabriel Ebner - Herbrand constructivization for automated intuitionistic theorem proving |

15:30 - 16:00 | break |

16:00 - 16:30 | Juan P. Aguilera - Systems of determinacy in third-order arithmetic |

16:30 - 17:00 | Jannik Vierling - Clause Set Cycles and Induction |

17:00 - 17:30 | David Cerna - A Structural Semantics for Recursive Proof Calculi |

17:30 - 18:00 | Dino Rossegger - The complexity of scattered linear orderings |

Saturday 8 December 2018: "Seminarraum" (room number DA05E10) 5th floor green area, Freihaus, TU Wien, Wiedner Hauptstrasse 8-10, 1040 Wien

Contact information: Matthias Baaz +43 699 11215168

- Matthias Baaz (co-chair)
- Anela Lolic (co-chair)
- Georg Moser
- Michel Parigot
- Lutz Straßburger