🚀 go-pugleaf

Kurt Goedel Society            Technische Universitat Wien 
                               Institut fuer Computersprachen

Workshop on

PROOF THEORY, COMPLEXITY, METAMATHEMATICS
=========================================
April 5--8, 1994
University of Technology, Vienna, Austria

PROGRAM
-------

Lectures will take place in Hoersaal 14A of the Technische Universitaet
Wien, Karlsplatz 13 (main building), main entrance, 3rd floor.
Visitiors are welcome.


Tuesday, April 5
================
Tuesday Morning

9:30           Opening Remarks

9:40--10:40    Invited Paper
Arnon Avron (Tel Aviv)
The Hypersequents Method in Proof-Theory of Non-classical Logics

11:00--12:00   Invited Paper
Alessandra Carbone (Paris)
On the Logical Structure of Proofs

12:00--13:30 Lunch Break


Tuesday Afternoon

13:30--14:30   Invited Paper
Lavinia Egidi (Torino)
On Efficient Quantifier Elimination in p-adic Fields

14:50--15:50   Invited Paper
Giovanni Faglia (Milano)
Independence of Feasible Inseparability from Logical Languages

16:10--16:30   
Kazuyuki Tanaka (Tohoku)
The Self-Embedding Theorem of WKL_0



Wednesday, April 6
==================
Wednesday Morning

9:15--9:35   
Mario Chiari (Prague)
A Non-conservation Result for Bounded Arithmetic and Search Problems

9:45--10:45   Invited Paper
Pavel Pudlak (Prague)
Complexity of Propositional Calculus and Relations to Bounded Arithmetic

11:00--12:00   Invited Paper
Jan Krajicek (Prague)
Problems of Complexity Theory in Models of Bounded Arithmetic

12:00--13:30   Lunch Break   


Wednesday Afternoon

13:30--14:30   Invited Paper
Elmar Eder (Salzburg)
Title to be announced

14:50--15:50   Invited Paper
Alexander Leitsch (Vienna)
Skolemization and Function Introduction

15:50--16:20   Invited Paper
Matthias Baaz (Vienna)
Hilbert's Epsilon-Formalism and Skolemization

16:40--17:00   
Uwe Egly (Darmstadt)
Title to be announced

19:00   Conference Dinner   



Thursday, April 7
=================
Thursday Morning

9:45--10:45    Invited Paper
Soren Riis (Oxford)
Separating NP and co-NP, Relative to Certain Proof-Systems

11:00--12:00   Invited Paper
Georg Gottlob (Vienna)
Trees over NP and Carnap's Modal Logic

12:00--13:30   Lunch Break   


Thursday Afternoon

13:30--14:30   Invited Paper
Vladimir Orevkov (St. Petersburg)
Estimates of Proof Lengths in Axiomatic Theories

14:50--15:50   Invited Paper
Piotr Wojtylak (Katowice)
Generalizing Proofs in Monadic Languages

15:50--16:20   Invited Paper
Matthias Baaz (Vienna)
Remarks on Generalization of Proofs

16:40--17:00   
Antonin Sochor (Prague)
Models of Set Theories


Friday, April 8
===============
Friday Morning

9:15--10:15    Invited Paper
Alessandro Berarducci (Pisa)
Delta_0-Complexity of the Relation y = \Pi_i<=n F(i)

10:30--11:30   Invited Paper
Michel Parigot (Paris)
Confluent Computational Interpretations of Classical Logic

11:30--13:00   Lunch Break   


Friday Afternoon

13:00--14:00   Invited Paper
Vincent Danos (Paris)
Linear Logic and Classical Logic I

14:20--15:20   Invited Paper
Jean-Baptiste Joinet (Paris)
Linear Logic and Classical Logic II