Logical Foundations of Computer Science

International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings

  • Sergei Artemov
  • Anil Nerode
Conference proceedings LFCS 2016

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9537)

Table of contents

  1. Front Matter
    Pages I-X
  2. Antonis Achilleos
    Pages 1-13
  3. Evangelia Antonakos
    Pages 14-26
  4. Sergei Artemov
    Pages 27-42
  5. Marco Devesas Campos, Marcelo Fiore
    Pages 43-59
  6. Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel
    Pages 60-75
  7. Harley Eades III, Valeria de Paiva
    Pages 90-105
  8. Nathanaël Fijalkow
    Pages 106-116
  9. Henrik Forssell, Håkon Robbestad Gylterud, David I. Spivak
    Pages 117-129
  10. Max Kanovich, Stepan Kuznetsov, Andre Scedrov
    Pages 146-158
  11. Ioannis Kokkinis, Zoran Ognjanović, Thomas Studer
    Pages 174-186
  12. Vladimir N. Krupski, Alexey Yatmanov
    Pages 187-201
  13. Daniel R. Licata, Michael Shulman
    Pages 219-235
  14. Robert S. Lubarsky
    Pages 236-250
  15. Henryk Michalewski, Matteo Mio
    Pages 267-282
  16. Shoshin Nomura, Hiroakira Ono, Katsuhiko Sano
    Pages 283-298
  17. R. Ramanujam, R. S. Thinniyam
    Pages 331-348
  18. R. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh
    Pages 349-363
  19. Rick Statman
    Pages 392-406
  20. Back Matter
    Pages 407-407

About these proceedings


This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2016, held in Deerfield Beach, FL, USA in January 2016. The 27 revised full papers were carefully reviewed and selected from 46 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized 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 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; non-monotonic 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.


constructive mathematics and type theory homotopy type theory logic in computer science 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 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 logics of proof and justification logic in game theory and social software, logic of hybrid systems, distributed system logics

Editors and affiliations

  • Sergei Artemov
    • 1
  • Anil Nerode
    • 2
  1. 1.City University of New York New YorkUSA
  2. 2.Cornell University IthacaUSA

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-319-27682-3
  • Online ISBN 978-3-319-27683-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software