Logical Foundations of Computer Science

International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007. Proceedings

Editors:

ISBN: 978-3-540-72732-3 (Print) 978-3-540-72734-7 (Online)

Table of contents (35 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-11

    Justified and Common Knowledge: Limited Conservativity

  3. No Access

    Book Chapter

    Pages 12-25

    The Intensional Lambda Calculus

  4. No Access

    Book Chapter

    Pages 26-40

    Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers

  5. No Access

    Book Chapter

    Pages 41-53

    Elementary Differential Calculus on Discrete and Hybrid Structures

  6. No Access

    Book Chapter

    Pages 54-68

    Weighted Distributed Systems and Their Logics

  7. No Access

    Book Chapter

    Pages 69-83

    Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

  8. No Access

    Book Chapter

    Pages 84-99

    On Decidability and Expressiveness of Propositional Interval Neighborhood Logics

  9. No Access

    Book Chapter

    Pages 100-114

    Reasoning About Sequences of Memory States

  10. No Access

    Book Chapter

    Pages 115-131

    Cut Elimination in Deduction Modulo by Abstract Completion

  11. No Access

    Book Chapter

    Pages 132-146

    Density Elimination and Rational Completeness for First-Order Logics

  12. No Access

    Book Chapter

    Pages 147-161

    Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus

  13. No Access

    Book Chapter

    Pages 162-179

    Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics

  14. No Access

    Book Chapter

    Pages 180-194

    A Decidable Temporal Logic of Repeating Values

  15. No Access

    Book Chapter

    Pages 195-211

    Model Checking Knowledge and Linear Time: PSPACE Cases

  16. No Access

    Book Chapter

    Pages 212-223

    Realizations and LP

  17. No Access

    Book Chapter

    Pages 224-240

    Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking

  18. No Access

    Book Chapter

    Pages 241-253

    Explicit Proofs in Formal Provability Logic

  19. No Access

    Book Chapter

    Pages 254-268

    A Synthesis Algorithm for Hybrid Systems

  20. No Access

    Book Chapter

    Pages 269-283

    Including the Past in ‘Topologic’

  21. No Access

    Book Chapter

    Pages 284-292

    A Note on Rewriting Proofs and Fibonacci Numbers

previous Page of 2