Logical Foundations of Computer Science

Logical Foundations of Computer Science: International Symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018, Proceedings (Lecture Notes in Computer Science)

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.

Table of Contents

Chapter 1. The Completeness Problem for Modal Logic
Chapter 2. Justification Awareness Models
Chapter 3. A Minimal Computational Theory of a Minimal Computational Universe
Chapter 4. A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem
Chapter 5. Angluin Learning via Logic
Chapter 6. A Universal Algebra for the Variable-Free Fragment of RC
Chapter 7. A Logic of Blockchain Updates
Chapter 8. From Display to Labelled Proofs for Tense Logics
Chapter 9. Notions of Cauchyness and Metastability
Chapter 10. A Gödel-Artemov-Style Analysis of Constructible Falsity
Chapter 11. Probabilistic Reasoning About Simply Typed Lambda Terms
Chapter 12. Polyteam Semantics
Chapter 13. On the Sharpness and the Single-Conclusion Property of Basic Justification Models
Chapter 14. Founded Semantics and Constraint Semantics of Logic Rules
Chapter 15. Separating the Fan Theorem and Its Weakenings II
Chapter 16. Dialectica Categories for the Lambek Calculus
Chapter 17. From Epistemic Paradox to Doxastic Arithmetic
Chapter 18. A Natural Proof System for Herbrand’s Theorem
Chapter 19. Metastability and Higher-Order Computability
Chapter 20. The Completeness of BCD for an Operational Semantics
Chapter 21. A Tableau System for Instantial Neighborhood Logic
Chapter 22. Interpretations of Presburger Arithmetic in Itself