Logical Foundations of Computer Science

International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings

  • Sergei Artemov
  • Anil Nerode
Conference proceedings LFCS 2018

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

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

Table of contents

  1. Front Matter
    Pages I-X
  2. Antonis Achilleos
    Pages 1-21
  3. Sergei Artemov
    Pages 22-36
  4. Matthias Baaz, Alexander Leitsch, Anela Lolic
    Pages 55-71
  5. Simone Barlocco, Clemens Kupke
    Pages 72-90
  6. Kai Brünnler, Dandolo Flumini, Thomas Studer
    Pages 107-119
  7. Agata Ciabattoni, Tim Lyon, Revantha Ramanayake
    Pages 120-139
  8. Hannes Diener, Robert Lubarsky
    Pages 140-153
  9. Thomas Macaulay Ferguson
    Pages 154-169
  10. Silvia Ghilezan, Jelena Ivetić, Simona Kašterović, Zoran Ognjanović, Nenad Savić
    Pages 170-189
  11. Miika Hannula, Juha Kontinen, Jonni Virtema
    Pages 190-210
  12. Yanhong A. Liu, Scott D. Stoller
    Pages 221-241
  13. Robert S. Lubarsky
    Pages 242-255
  14. Valeria de Paiva, Harley Eades III
    Pages 256-272
  15. V. Alexis Peluce
    Pages 273-288

About these proceedings

Introduction

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

The 22 revised full papers were carefully reviewed and selected from 22 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.

Keywords

constructive mathematics and type theory homotopy type theory logic in computer science automata and automatic structures logical foundations of programming logical aspects of computational complexity logic programming and constraints domain theory logics logical foundations of database theory linear logic epistemic and temporal logics distributed system logics Computer science Artificial intelligence Problem solving Theorem proving Formal logic Finite element method Modal logic Modal analysis

Editors and affiliations

  • Sergei Artemov
    • 1
  • Anil Nerode
    • 2
  1. 1.City University of New YorkNew YorkUSA
  2. 2.Cornell UniversityIthacaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-72056-2
  • Copyright Information Springer International Publishing AG 2018
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-72055-5
  • Online ISBN 978-3-319-72056-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book