Aims and Scope
The workshop PCC '03 is held in conjunction with the Summer School on Proof Theory, Computation, and Complexity in Dresden, joining the successors to last year's corresponding events (Proof Theory and Computation in Dresden and Proof, Computation, Complexity in Tübingen). The aim of PCC is to stimulate research in proof theory, computation, and complexity, focusing on issues which combine logical and computational aspects. Topics may include applications of formal inference systems in computer science, as well as new developments in proof theory motivated by computer science demands. Specific areas of interest are (non-exhaustively listed) foundations for declarative programming languages, logical methods in specification and program development, new developments in structural proof theory, and implicit computational complexity.
PCC is intended to be a lively forum for presenting and discussing recent work.
There will be no published proceedings of full papers, allowing for simultaneous
or subsequent conference or
journal submission of the presented material, but participants who want to
contribute a talk are asked to submit a one-page-abstract (LaTeX). The collection of abstracts will be
available at the meeting.
Deadline: May 25th, 2003
Submission of abstracts: firstname.lastname@example.org
Registration and further information see http://www.ki.inf.tu-dresden.de/~guglielm/WPT2.
|Kai Brünnler||Interpolation as Symmetric Cut Elimination|
|Alwen Tiu||Induction and Coinduction in Sequent Calculus|
|Phiniki Stouppa||Is deep inference necessary for good proof theoretic treatments of modal logic?|
|Lutz Straßburger||System NEL is undecidable|
|Pascal Hitzler||Domain Theory and Nonmonotonic Reasoning|
|Birgit Elbl||Goal Composition and Local Variables|
|Karl-Heinz Niggl||The Garland Measure and Computational Complexity of Imperative Programs|
|Henning Wunderlich||Characterising FPTIME Through Stack Programs with Arbitrary Primitives|
|Isabel Oitavem||Characterising PSPACE with Pointers|
|Lars Kristiansen||Computing without the Successor Function. New Characterizations of Well Known Complexity Classes.|
|Heinrich Wansing||On the Negation of Action Types: Constructive Concurrent PDL|
|Monika Seisenberger||A-Translation of Higman's Lemma|
|Reinhard Kahle||Dynamic Logic Programming|