Logical Foundations of Computer Science

This bookconstitutes the refereed proceedings of the International Symposium on LogicalFoundations of Computer Science, LFCS 2016, held in Deerfield Beach, FL, USA inJanuary 2016. The 27 revised full paperswere carefully reviewed and selected from 46 submissions. The scopeof the Symposium is broad and includes constructive mathematics and typetheory; homotopy type theory; logic, automata, and automatic structures;computability and randomness; logical foundations of programming; logicalaspects of computational complexity; parameterized complexity; logicprogramming and constraints; automated deduction and interactive theoremproving; logical methods in protocol and program verification; logical methodsin program specification and extraction; domain theory logics; logicalfoundations of database theory; equational logic and term rewriting; lambda andcombinatory 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 gametheory and social software; logic of hybrid systems; distributed system logics;mathematical fuzzy logic; system design logics; and other logics in computerscience.