## Computer Science Logic: 19th International Workshop, CSL 2005, 14th Annual Conference of the EACSL, Oxford, UK, August 22-25, 2005, ProceedingsTheAnnualConferenceoftheEuropeanAssociationforComputerScienceLogic (EACSL), CSL 2005, was held at the University of Oxford on 22–25 August 2005. The conference series started as a programme of International Workshops onComputerScienceLogic,andtheninits6thmeetingbecametheAnnualC- ference of the EACSL. This conference was the 19th meeting and 14th EACSL conference; it was organized by the Computing Laboratory at the University of Oxford. The CSL 2005 Programme Committee considered 108 submissions from 25 countries during a two-week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 33 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Matthias Baaz, Ulrich Berger, Maarten Marx and Anatol Slissenko; the papers provided by the invited speakers appear at the front of this volume. Instituted in 2005, the Ackermann Award is the EACSL Outstanding D- sertation Award for Logic in Computer Science. The award winners for the - augural year, Mikola j Bojanczyk, ´ Konstantin Korovin and Nathan Segerlind, were invited to present their work at the conference. Citations for the awards, abstracts of the theses, and biographical sketches of the award winners are at the end of the proceedings. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

I | 1 |

II | 3 |

III | 18 |

IV | 27 |

V | 36 |

VI | 51 |

VII | 70 |

VIII | 87 |

XXII | 309 |

XXIII | 325 |

XXIV | 339 |

XXV | 355 |

XXVI | 369 |

XXVII | 384 |

XXVIII | 397 |

XXIX | 413 |

### Other editions - View all

### Common terms and phrases

abstract algebra algorithm applied arithmetic assume axiom binary binary relation bounded coalgebra complexity class Computer Science consider constant constraints construction coprimality corresponding Datalog decidable deﬁnable define deﬁned deﬁnition denote derivation deterministic diﬀerent elements equivalence relations equivalent example existential exists ExpTime extended ﬁeld ﬁnd ﬁnite ﬁrst ﬁrst-order logic ﬁxed ﬁxpoint formula free variables function given graph hence homomorphism iﬀ induction inﬁnite input interpretation L-net lambda calculus language Lemma linear logic LNCS modal modal logic model checking monoidal natural numbers node normal form operators partial partially traced polynomial position predicate problem proof Proposition prove quantiﬁed real numbers recursive relational structure representation restricted result rules satisﬁability second-order semantics sequent calculus strong monad subset symbols Theorem theory tile topology trace class tree treewidth unary veriﬁcation winning strategy