Logical Foundations of Computer Science: International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings (Lecture Notes in Computer Science, 7734)

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. Front Matter....Pages - Compositional Reasoning for Multi-modal Logics....Pages 1-15 Explicit Generic Common Knowledge....Pages 16-28 Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification....Pages 29-43 Assignment Calculus: A Pure Imperative Language....Pages 44-58 Multiplayer Cost Games with Simple Nash Equilibria....Pages 59-73 Forward Chaining for Hybrid ASP....Pages 74-88 Effectivity Questions for Kleene’s Recursion Theorem....Pages 89-103 Sub-computable Bounded Pseudorandomness....Pages 104-118 Automated Support for the Investigation of Paraconsistent and Other Logics....Pages 119-133 A Modal BI Logic for Dynamic Resource Properties....Pages 134-148 Stuttering for Abstract Probabilistic Automata....Pages 149-163 Call-by-Value Non-determinism in a Linear Logic Type Discipline....Pages 164-178 The Wadge Hierarchy of Petri Nets ω -Languages....Pages 179-193 Iterated Contraction Based on Indistinguishability....Pages 194-205 A Note on Extensions: Admissible Rules via Semantics....Pages 206-218 Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference....Pages 219-233 Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems....Pages 234-251 Computational Hardness of Validity in Probability Logic....Pages 252-265 Update as Evidence: Belief Expansion....Pages 266-279 Separating the Fan Theorem and Its Weakenings....Pages 280-295 The Logic of Uncertain Justifications....Pages 296-306 Justifications, Awareness and Epistemic Dynamics....Pages 307-318 Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars....Pages 319-334 Constructive Polychronous Systems....Pages 335-349 On Tolerance Analysis of Games with Belief Revision....Pages 350-358 Temporalizing Modal Epistemic Logic....Pages 359-371 Contextual Natural Deduction....Pages 372-386 Conservatively Approximable Functions....Pages 387-400 Self-referentiality in the Brouwer–Heyting–Kolmogorov Semantics of Intuitionistic Logic....Pages 401-414 Back Matter....Pages -