Skip to main content
  • Conference proceedings
  • © 2018

Logical Foundations of Computer Science

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

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

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 2018.

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-72056-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 79.99
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (22 papers)

  1. Front Matter

    Pages I-X
  2. The Completeness Problem for Modal Logic

    • Antonis Achilleos
    Pages 1-21
  3. Justification Awareness Models

    • Sergei Artemov
    Pages 22-36
  4. A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem

    • Matthias Baaz, Alexander Leitsch, Anela Lolic
    Pages 55-71
  5. Angluin Learning via Logic

    • Simone Barlocco, Clemens Kupke
    Pages 72-90
  6. A Logic of Blockchain Updates

    • Kai Brünnler, Dandolo Flumini, Thomas Studer
    Pages 107-119
  7. From Display to Labelled Proofs for Tense Logics

    • Agata Ciabattoni, Tim Lyon, Revantha Ramanayake
    Pages 120-139
  8. Notions of Cauchyness and Metastability

    • Hannes Diener, Robert Lubarsky
    Pages 140-153
  9. A Gödel-Artemov-Style Analysis of Constructible Falsity

    • Thomas Macaulay Ferguson
    Pages 154-169
  10. Probabilistic Reasoning About Simply Typed Lambda Terms

    • Silvia Ghilezan, Jelena Ivetić, Simona Kašterović, Zoran Ognjanović, Nenad Savić
    Pages 170-189
  11. Polyteam Semantics

    • Miika Hannula, Juha Kontinen, Jonni Virtema
    Pages 190-210
  12. Founded Semantics and Constraint Semantics of Logic Rules

    • Yanhong A. Liu, Scott D. Stoller
    Pages 221-241
  13. Separating the Fan Theorem and Its Weakenings II

    • Robert S. Lubarsky
    Pages 242-255
  14. Dialectica Categories for the Lambek Calculus

    • Valeria de Paiva, Harley Eades III
    Pages 256-272
  15. From Epistemic Paradox to Doxastic Arithmetic

    • V. Alexis Peluce
    Pages 273-288

Other Volumes

  1. Logical Foundations of Computer Science

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

About this book

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

  • City University of New York, New York, USA

    Sergei Artemov

  • Cornell University, Ithaca, USA

    Anil Nerode

Bibliographic Information

Buying options

eBook USD 59.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-72056-2
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 79.99
Price excludes VAT (USA)