Logical Foundations of Computer Science

International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings

  • Sergei Artemov
  • Anil Nerode
Conference proceedings LFCS 2013

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

Table of contents

  1. Front Matter
  2. Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, Joshua Sack
    Pages 1-15
  3. Evangelia Antonakos
    Pages 16-28
  4. Gilles Barthe, Juan Manuel Crespo, César Kunz
    Pages 29-43
  5. Marc Bender, Jeffery Zucker
    Pages 44-58
  6. Thomas Brihaye, Julie De Pril, Sven Schewe
    Pages 59-73
  7. Alex Brik, Jeffrey B. Remmel
    Pages 74-88
  8. John Case, Sanjay Jain, Frank Stephan
    Pages 89-103
  9. Douglas Cenzer, Jeffrey B. Remmel
    Pages 104-118
  10. Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky
    Pages 119-133
  11. J. R. Courtault, D. Galmiche
    Pages 134-148
  12. Benoît Delahaye, Kim G. Larsen, Axel Legay
    Pages 149-163
  13. Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
    Pages 164-178
  14. Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
    Pages 179-193
  15. Konstantinos Georgatos
    Pages 194-205
  16. Roman Kuznets, Thomas Studer
    Pages 266-279
  17. Robert S. Lubarsky, Hannes Diener
    Pages 280-295
  18. Bob Milnikel
    Pages 296-306
  19. Jean-Pierre Talpin, Jens Brandt, Mike Gemünde, Klaus Schneider, Sandeep Shukla
    Pages 335-349
  20. Çağıl Taşdemir
    Pages 350-358
  21. Ren-June Wang
    Pages 359-371
  22. Bruno Woltzenlogel Paleo
    Pages 372-386
  23. Sebastian Wyman
    Pages 387-400
  24. Back Matter

About these proceedings


This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; 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; logical methods in program specification and extraction; domain theory logic; 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; mathematical fuzzy logic; system design logics; and other logics in computer science.


algorithmic randomness effective symbolic dynamics inductive inference multi-modal logic probabilistic automata

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
  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-35721-3
  • Online ISBN 978-3-642-35722-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Energy, Utilities & Environment