Computer Science Proof, Complexity and Verification Seminar Series
The idea for the PCV Seminar Series grew amongst members of our theory group who felt a need for a platform to present our work in the area of Proof Theory, Complexity Theory and Program Verification. It is intended to be a high level research seminar where we can discuss latest ideas and results, as well as address technical issues, and are able to invite speakers from outside.
In the beginning of 2005, this idea turned into the PCV Seminar.
Organizers so far have been Markus Michelbrink (see here for talks organised by him), Will Harwood, Klaus Aehlig, and Monika Seisenberger. From January 2010 on, Fredrik Nordvall Forsberg and Matthew Gwynne organise the seminar.
20072008

Wednesday 3rd October 2007, 14:15, Board Room
Manfred Droste (Universität Leipzig)
Almost every domain is universal

Thursday 18th October 2007, 14:00, Robert Record Room
Petter Kristian Kober (Swansea (on leave from Oslo))
Definitions by positive induction in a category of domain representable spaces

Thursday 6th December 2007, 14:00, Board Room
Annelies Gerber (Swansea)
Towards Geometrical Models of Proof Systems and Hidden Resolution Proofs

Thursday 14th February 2008, 14:00, Board Room
Faron Moller (Swansea)
Games for Modelchecking

Thursday 28th February 2008, 14:00, Board Room
Arnold Beckmann (Swansea)
On the complexity of parity games

Thursday 6th March 2008, 14:00, Robert Recorde Room
Klaus T Aehlig (Swansea)
Hauptseminar "Theory of Computation": IP = PSPACE, part 1

Thursday 13th March 2008, 14:00, Robert Recorde Room (Talk in Colloquium)
Zhaohui Luo (Royal Holloway, University of London)
Type theory and its applications

Tuesday 1st April 2008, 14:00, Robert Recorde Room
Christian Urban (TU München)
Nominal Techniques in the Theorem Prover Isabelle or, How
Not to be Intimidated by the Variable Convention

Thursday 17th April 2008, 14:00, Robert Recorde Room
John Crossley (Monash University)
Double Decker Logic

Thursday 24th April 2008, 14:00, Robert Recorde Room
Klaus T Aehlig (Swansea)
Hauptseminar "Theory of Computation": IP = PSPACE, part 2

Thursday 1st May 2008, 14:00, Robert Recorde Room
Petter Kristian Kober (Swansea)
Hauptseminar "Theory of Computation": Complexity of Decidable Theories

Thursday 8th May 2008, 14:00, Robert Recorde Room
Jose Felix Costa (Lisboa (visiting Swansea))
A Foundation for Real Recursive Function Theory

Thursday 15th May 2008, 14:00, Robert Recorde Room
Dieter Spreen (Siegen (visiting Swansea))
Effectivity and effective continuity of multifunctions

Tuesday 20th May 2008, 14:00, Robert Recorde Room
Peter D Mosses (joint work with Mark New) (Swansea)
Implicit Propagation in Structural Operational Semantics

Thursday 29th May 2008, 14:00, Robert Recorde Room
Petter Kristian Kober (Oslo, visiting Swansea)
Inductive Definitions over Domain Representable Spaces

Thursday 5th June 2008, 15:00 (!), Robert Recorde Room
Graham Birtwistle (University of Sheffield)
The family of 4phase latch controllers