Skip to main content
Springer Nature Link
Log in

Logical Foundations of Computer Science

International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4-7, 2016. Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Sergei Artemov

    1. City University of New York , New York, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Anil Nerode

    1. Cornell University , Ithaca, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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)

Included in the following conference series:

Conference proceedings info: LFCS 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

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.

Similar content being viewed by others

Keywords

Table of contents (27 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Modal Logics with Hard Diamond-Free Fragments

    • Antonis Achilleos
    Pages 1-13

  3. Pairing Traditional and Generic Common Knowledge

    • Evangelia Antonakos
    Pages 14-26

  4. On Aggregating Probabilistic Evidence

    • Sergei Artemov
    Pages 27-42

  5. Classical Logic with Mendler Induction

    • Marco Devesas Campos, Marcelo Fiore
    Pages 43-59

  6. Index Sets for Finite Normal Predicate Logic Programs with Function Symbols

    • Douglas Cenzer, Victor W. Marek, Jeffrey B. Remmel
    Pages 60-75

  7. Multiple Conclusion Rules in Logics with the Disjunction Property

    • Alex Citkin
    Pages 76-89

  8. Multiple Conclusion Linear Logic: Cut Elimination and More

    • Harley Eades III, Valeria de Paiva
    Pages 90-105

  9. The Online Space Complexity of Probabilistic Languages

    • Nathanaël Fijalkow
    Pages 106-116

  10. Type Theoretical Databases

    • Henrik Forssell, Håkon Robbestad Gylterud, David I. Spivak
    Pages 117-129

  11. Augmenting Subset Spaces to Cope with Multi-agent Knowledge

    • Bernhard Heinemann
    Pages 130-145

  12. On Lambek’s Restriction in the Presence of Exponential Modalities

    • Max Kanovich, Stepan Kuznetsov, Andre Scedrov
    Pages 146-158

  13. A Quest for Algorithmically Random Infinite Structures, II

    • Bakhadyr Khoussainov
    Pages 159-173

  14. Probabilistic Justification Logic

    • Ioannis Kokkinis, Zoran Ognjanović, Thomas Studer
    Pages 174-186

  15. Sequent Calculus for Intuitionistic Epistemic Logic IEL

    • Vladimir N. Krupski, Alexey Yatmanov
    Pages 187-201

  16. Interpolation Method for Multicomponent Sequent Calculi

    • Roman Kuznets
    Pages 202-218

  17. Adjoint Logic with a 2-Category of Modes

    • Daniel R. Licata, Michael Shulman
    Pages 219-235

  18. Parallel Feedback Turing Computability

    • Robert S. Lubarsky
    Pages 236-250

  19. Compactness in the Theory of Continuous Automata

    • Scott Messick
    Pages 251-266

  20. Measure Quantifier in Monadic Second Order Logic

    • Henryk Michalewski, Matteo Mio
    Pages 267-282
Back to top

Other volumes

  1. Logical Foundations of Computer Science

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

  • Topics: Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Back to top