↓ Skip to main content

Computer Science Logic

Overview of attention for book
Cover of 'Computer Science Logic'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Topological Queries in Spatial Databases
  3. Altmetric Badge
    Chapter 2 The Consistency Dimension, Compactness, and Query Learning
  4. Altmetric Badge
    Chapter 3 Descriptive and Parameterized Complexity
  5. Altmetric Badge
    Chapter 4 Logical Specification of Operational Semantics
  6. Altmetric Badge
    Chapter 5 Constraint-Based Analysis of Broadcast Protocols
  7. Altmetric Badge
    Chapter 6 Descriptive Complexity Theory for Constraint Databases
  8. Altmetric Badge
    Chapter 7 Applicative Control and Computational Complexity
  9. Altmetric Badge
    Chapter 8 Applying Rewriting Techniques to the Verification of Erlang Processes
  10. Altmetric Badge
    Chapter 9 Difference Decision Diagrams
  11. Altmetric Badge
    Chapter 10 Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States
  12. Altmetric Badge
    Chapter 11 Verifying Liveness by Augmented Abstraction
  13. Altmetric Badge
    Chapter 12 Signed Interval Logic
  14. Altmetric Badge
    Chapter 13 Quantitative Temporal Logic
  15. Altmetric Badge
    Chapter 14 An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces
  16. Altmetric Badge
    Chapter 15 Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting
  17. Altmetric Badge
    Chapter 16 Closed Reductions in the λ-Calculus
  18. Altmetric Badge
    Chapter 17 Kripke Resource Models of a Dependently-Typed, Bunched λ-Calculus (Extended Abstract)
  19. Altmetric Badge
    Chapter 18 A Linear Logical View of Linear Type Isomorphisms
  20. Altmetric Badge
    Chapter 19 Choice Logic Programs and Nash Equilibria in Strategic Games
  21. Altmetric Badge
    Chapter 20 Resolution Method for Modal Logic with Well-Founded Frames
  22. Altmetric Badge
    Chapter 21 A NExpTime-Complete Description Logic Strictly Contained in C 2
  23. Altmetric Badge
    Chapter 22 A Road-Map on Complexity for Hybrid Logics
  24. Altmetric Badge
    Chapter 23 MonadicNLIN and Quantifier-Free Reductions
  25. Altmetric Badge
    Chapter 24 Directed Reachability: From Ajtai-Fagin to Ehrenfeucht-Fraïssé Games
  26. Altmetric Badge
    Chapter 25 Fixpoint Alternation and the Game Quantifier
  27. Altmetric Badge
    Chapter 26 Lower Bounds for Space in Resolution
  28. Altmetric Badge
    Chapter 27 Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws
  29. Altmetric Badge
    Chapter 28 Open Least Element Principle and Bounded Query Computation
  30. Altmetric Badge
    Chapter 29 A Universal Innocent Game Model for the Böhm Tree Lambda Theory
  31. Altmetric Badge
    Chapter 30 Anti-Symmetry of Higher-Order Subtyping
  32. Altmetric Badge
    Chapter 31 Safe Proof Checking in Type Theory with Y
  33. Altmetric Badge
    Chapter 32 Monadic Presentations of Lambda Terms Using Generalized Inductive Types
  34. Altmetric Badge
    Chapter 33 A P-Time Completeness Proof for Light Logics
  35. Altmetric Badge
    Chapter 34 On Guarding Nested Fixpoints
  36. Altmetric Badge
    Chapter 35 A Logical Viewpoint on Process-Algebraic Quotients
  37. Altmetric Badge
    Chapter 36 A Truly Concurrent Semantics for a Simple Parallel Programming Language
  38. Altmetric Badge
    Chapter 37 Specification Refinement with System F
  39. Altmetric Badge
    Chapter 38 Pre-logical Relations
  40. Altmetric Badge
    Chapter 39 Data-Refinement for Call-By-Value Programming Languages
  41. Altmetric Badge
    Chapter 40 Tutorial on Term Rewriting
  42. Altmetric Badge
    Chapter 41 Tutorial on Interactive Theorem Proving Using Type Theory
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
2 Wikipedia pages

Readers on

mendeley
6 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Computer Science Logic
Published by
Springer, Berlin, Heidelberg, January 1999
DOI 10.1007/3-540-48168-0
ISBNs
978-3-54-066536-6, 978-3-54-048168-3
Editors

Jörg Flum, Mario Rodriguez-Artalejo

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 33%
Student > Master 1 17%
Lecturer 1 17%
Student > Doctoral Student 1 17%
Student > Postgraduate 1 17%
Other 0 0%
Readers by discipline Count As %
Computer Science 5 83%
Economics, Econometrics and Finance 1 17%