Skip to main content
SpringerLink
Log in
Book cover

Logical Foundations of Computer Science

International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings

  • Conference proceedings
  • © 2013

Overview

Editors:
  1. Sergei Artemov

    1. Computer Science, CUNY Graduate Center, New York, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Anil Nerode

    1. Department of Mathematics, Cornell University, Ithaca, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up to date results
  • Fast track conference proceedings
  • State of the art research

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

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

Included in the following conference series:

Conference proceedings info: LFCS 2013.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Compositional Reasoning for Multi-modal Logics

    • Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, Joshua Sack
    Pages 1-15

  3. Explicit Generic Common Knowledge

    • Evangelia Antonakos
    Pages 16-28

  4. Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification

    • Gilles Barthe, Juan Manuel Crespo, César Kunz
    Pages 29-43

  5. Assignment Calculus: A Pure Imperative Language

    • Marc Bender, Jeffery Zucker
    Pages 44-58

  6. Multiplayer Cost Games with Simple Nash Equilibria

    • Thomas Brihaye, Julie De Pril, Sven Schewe
    Pages 59-73

  7. Forward Chaining for Hybrid ASP

    • Alex Brik, Jeffrey B. Remmel
    Pages 74-88

  8. Effectivity Questions for Kleene’s Recursion Theorem

    • John Case, Sanjay Jain, Frank Stephan
    Pages 89-103

  9. Sub-computable Bounded Pseudorandomness

    • Douglas Cenzer, Jeffrey B. Remmel
    Pages 104-118

  10. Automated Support for the Investigation of Paraconsistent and Other Logics

    • Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky
    Pages 119-133

  11. A Modal BI Logic for Dynamic Resource Properties

    • J. R. Courtault, D. Galmiche
    Pages 134-148

  12. Stuttering for Abstract Probabilistic Automata

    • Benoît Delahaye, Kim G. Larsen, Axel Legay
    Pages 149-163

  13. Call-by-Value Non-determinism in a Linear Logic Type Discipline

    • Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani
    Pages 164-178

  14. The Wadge Hierarchy of Petri Nets ω-Languages

    • Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre
    Pages 179-193

  15. Iterated Contraction Based on Indistinguishability

    • Konstantinos Georgatos
    Pages 194-205

  16. A Note on Extensions: Admissible Rules via Semantics

    • Jeroen Goudsmit
    Pages 206-218

  17. Subset Space vs Relational Semantics of Bimodal Logic: Bringing Out the Difference

    • Bernhard Heinemann
    Pages 219-233

  18. Quantified Differential Temporal Dynamic Logic for Verifying Properties of Distributed Hybrid Systems

    • Ping Hou, Hao Zheng
    Pages 234-251

  19. Computational Hardness of Validity in Probability Logic

    • Rutger Kuyper
    Pages 252-265

  20. Update as Evidence: Belief Expansion

    • Roman Kuznets, Thomas Studer
    Pages 266-279
Back to top

Other volumes

  1. Logical Foundations of Computer Science

Keywords

About this book

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.

Editors and Affiliations

  • Computer Science, CUNY Graduate Center, New York, USA

    Sergei Artemov

  • Department of Mathematics, Cornell University, Ithaca, USA

    Anil Nerode

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation