Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9537)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): LFCS: International Symposium on Logical Foundations of Computer Science
Conference proceedings info: LFCS 2016.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (27 papers)
-
Front Matter
About this book
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.
Keywords
- 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
-
City University of New York , New York, USA
Sergei Artemov
-
Cornell University , Ithaca, USA
Anil Nerode
Bibliographic Information
Book Title: Logical Foundations of Computer Science
Book Subtitle: International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings
Editors: Sergei Artemov, Anil Nerode
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-319-27683-0
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Softcover ISBN: 978-3-319-27682-3Published: 10 December 2015
eBook ISBN: 978-3-319-27683-0Published: 14 December 2015
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 407
Number of Illustrations: 33 illustrations in colour