Skip to main content
Springer Nature Link
Log in

Logical Foundations of Computer Science

International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings

  • Conference proceedings
  • © 2020

Overview

Editors:
  1. Sergei Artemov

    1. The Graduate Center, CUNY, 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 11972)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: LFCS 2020.

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 2020, held in Deerfield Beach, FL, USA, in January 2020. The 17 revised full papers were carefully reviewed and selected from 30 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; other logics in computer science.

Similar content being viewed by others

Keywords

Table of contents (17 papers)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Computability of Algebraic and Definable Closure

    • Nathanael Ackerman, Cameron Freer, Rehana Patel
    Pages 1-11

  3. Observable Models

    • Sergei Artemov
    Pages 12-26

  4. Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics

    • Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel
    Pages 27-46

  5. Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory

    • Yannick Forster, Dominik Kirst, Dominik Wehr
    Pages 47-74

  6. On the Constructive Truth and Falsity in Peano Arithmetic

    • Hirohiko Kushida
    Pages 75-84

  7. Belief Expansion in Subset Models

    • Eveline Lehmann, Thomas Studer
    Pages 85-97

  8. Finitism, Imperative Programs and Primitive Recursion

    • Daniel Leivant
    Pages 98-110

  9. Knowledge of Uncertain Worlds: Programming with Logical Constraints

    • Yanhong A. Liu, Scott D. Stoller
    Pages 111-127

  10. A Globally Sound Analytic Calculus for Henkin Quantifiers

    • Matthias Baaz, Anela Lolic
    Pages 128-143

  11. Feedback Hyperjump

    • Robert S. Lubarsky
    Pages 144-155

  12. Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents

    • Tim Lyon
    Pages 156-176

  13. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems

    • Tim Lyon
    Pages 177-194

  14. Parameterised Complexity of Abduction in Schaefer’s Framework

    • Yasir Mahmood, Arne Meier, Johannes Schmidt
    Pages 195-213

  15. Tracking Computability of GPAC-Generable Functions

    • Diogo Poças, Jeffery Zucker
    Pages 214-235

  16. Modal Type Theory Based on the Intuitionistic Modal Logic \(\mathbf{IEL}^{-}\)

    • Daniel Rogozin
    Pages 236-248

  17. Lifting Recursive Counterexamples to Higher-Order Arithmetic

    • Sam Sanders
    Pages 249-267

  18. On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux Deduction

    • Dan E. Willard
    Pages 268-286

  19. Back Matter

    Pages 287-287
    Download chapter PDF
Back to top

Other volumes

  1. Logical Foundations of Computer Science

Editors and Affiliations

  • The Graduate Center, CUNY, New York, USA

    Sergei Artemov

  • Cornell University, Ithaca, USA

    Anil Nerode

Bibliographic Information

Publish with us

Policies and ethics

Back to top