PCC - Proof, Computation, Complexity
4th International Workshop
July 16-17, 2005, Lisbon
Aims and Scope
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 specification and programming languages,
logical methods in specification and program development,
new developments in structural proof theory,
and implicit computational complexity.
Past events were held
Contributions
PCC is intended to be a lively forum for presenting and discussing recent work.
The talks have a duration of 30min plus additional time for discussion.
Participants are asked to submit an abstract (LaTeX, 1-3 pages).
The collection of abstracts will be edited as a technical report and it will be
available at the meeting.
List of speakers
- Gilda Ferreira, University of Lisbon
Integration in systems of weak analysis
- Lew Gordeev, University of Tübingen
A combinatorial sentence that infers P < NP
- Lars Kristiansen, University of Oslo
Feasible programs and natural programming languages
- Oliver Kullmann, University of Wales
How to generalise conjunctive normal forms
- Karl-Heinz Niggl, University of Ilmenau
Certifying polynomial time and linear/polynomial space
for imperative programs
- Paulo Oliva, Queen Mary, University of London
Unifying functional interpretations
- Luís Pinto, University of Minho
Redundancies in an extension of the lambda-calculus and natural
fragments of sequent calculus
- João Rasga, Technical University of Lisbon
Complexity analysis of cut elimination in first order based logics
- José Espírito Santo, University of Minho
Unity in structural proof theory and structural extensions of the
lambda-calculus
- Stefan Schimanski, University of Munich
A quasi-linear typed term system for PTIME
- Anton Setzer, University of Wales
Towards a more algebraic treatment of ordinal notation systems
- Miroslava Sotakova, Charles University of Prague
Reversible circuits consisting of small gates
- Thomas Studer, University of Berne
A finitary cut-free axiomatization for stratified modal fixed point logic
- Ernst Zimmermann, IBM Böblingen
Combinatorial proofs of termination in natural deduction
Organization, registration and further information
The workshop PCC '05 is affiliated with the 32nd International Colloquium on Automata, Language and Programming ICALP'05.
It is organized by Reinhard Kahle, Isabel
Oitavem and Birgit Elbl, and it is supported by FCT-UNL and
CMAF-UL with support of the FCT and FEDER through POCTI.
Registration (via ICALP'05)
Hotel Reservation (via ICALP'05)
Information about the Workshop location you find here. Please
note that the workshop will take place at Instituto Superior
Técnico (Technical University of Lisbon) and not at the
location of the main ICALP conference.
Contact: Reinhard Kahle, kahle@fct.unl.pt