Logical Foundations of Computer Science

International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings

  • Sergei Artemov
  • Anil Nerode
Conference proceedings LFCS 2009

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5407)

Table of contents

  1. Front Matter
  2. Stefano Aguzzoli, Simone Bova, Vincenzo Marra
    Pages 1-15
  3. Carlos Areces, Santiago Figueira, Sergio Mera
    Pages 16-30
  4. Pedro Baltazar, Paulo Mateus
    Pages 46-60
  5. Eduardo Bonelli, Federico Feller
    Pages 76-91
  6. Thomas Brihaye, Arnaud Da Costa, François Laroussinie, Nicolas Markey
    Pages 92-106
  7. Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto
    Pages 107-121
  8. Samuel R. Buss, Roman Kuznets
    Pages 122-136
  9. Ugo Dal Lago, Luca Roversi, Luca Vercelli
    Pages 137-151
  10. Renata de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Petrucio Viana
    Pages 152-163
  11. Elisabetta De Maria, Angelo Montanari, Nicola Vitacolonna
    Pages 164-179
  12. Amélie Gheerbrant, Balder ten Cate
    Pages 180-196
  13. Stefan Hetzl, Alexander Leitsch, Daniel Weller, Bruno Woltzenlogel Paleo
    Pages 214-229
  14. Uwe Keller, Stijn Heymans
    Pages 265-279

About these proceedings

Introduction

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008.

The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.

Keywords

Automat automated deduction complexity game theory interactive theorem proving logic theorem proving

Editors and affiliations

  • Sergei Artemov
    • 1
  • Anil Nerode
    • 2
  1. 1.Computer ScienceCUNY Graduate CenterNew YorkUSA
  2. 2.Department of MathematicsCornell UniversityIthacaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-92687-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-92686-3
  • Online ISBN 978-3-540-92687-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book