↓ Skip to main content
What is this page? Embed badge

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 Deciding Monotonic Games
  3. Altmetric Badge
    Chapter 2 The Commuting V-Diagram
  4. Altmetric Badge
    Chapter 3 Concurrent Construction of Proof-Nets
  5. Altmetric Badge
    Chapter 4 Back to the Future: Explicit Logic for Computer Science
  6. Altmetric Badge
    Chapter 5 Constraint Satisfaction with Countable Homogeneous Templates
  7. Altmetric Badge
    Chapter 6 Quantified Constraints: Algorithms and Complexity
  8. Altmetric Badge
    Chapter 7 Verification of Infinite State Systems
  9. Altmetric Badge
    Chapter 8 Parity of Imperfection or Fixing Independence
  10. Altmetric Badge
    Chapter 9 Atomic Cut Elimination for Classical Logic
  11. Altmetric Badge
    Chapter 10 Computational Mathematics, Computational Logic, and Symbolic Computation
  12. Altmetric Badge
    Chapter 11 Simple Stochastic Parity Games
  13. Altmetric Badge
    Chapter 12 Machine Characterizations of the Classes of the W-Hierarchy
  14. Altmetric Badge
    Chapter 13 Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
  15. Altmetric Badge
    Chapter 14 On Relativisation and Complexity Gap for Resolution-Based Proof Systems
  16. Altmetric Badge
    Chapter 15 Strong Normalization of the Typed λ ws -Calculus
  17. Altmetric Badge
    Chapter 16 Computer Science Logic
  18. Altmetric Badge
    Chapter 17 Positive Games and Persistent Strategies
  19. Altmetric Badge
    Chapter 18 Generating All Abductive Explanations for Queries on Propositional Horn Theories
  20. Altmetric Badge
    Chapter 19 Refined Complexity Analysis of Cut Elimination
  21. Altmetric Badge
    Chapter 20 Comparing the Succinctness of Monadic Query Languages over Finite Trees
  22. Altmetric Badge
    Chapter 21 The Arithmetical Complexity of Dimension and Randomness
  23. Altmetric Badge
    Chapter 22 Towards a Proof System for Admissibility
  24. Altmetric Badge
    Chapter 23 Program Complexity of Dynamic LTL Model Checking
  25. Altmetric Badge
    Chapter 24 Coping Polynomially with Numerous but Identical Elements within Planning Problems
  26. Altmetric Badge
    Chapter 25 On Algebraic Specifications of Abstract Data Types
  27. Altmetric Badge
    Chapter 26 On the Complexity of Existential Pebble Games
  28. Altmetric Badge
    Chapter 27 Computational Aspects of Σ-Definability over the Real Numbers without the Equality Test
  29. Altmetric Badge
    Chapter 28 The Surprising Power of Restricted Programs and Gödel’s Functionals
  30. Altmetric Badge
    Chapter 29 Pebble Games on Trees
  31. Altmetric Badge
    Chapter 30 Bistability: An Extensional Characterization of Sequentiality
  32. Altmetric Badge
    Chapter 31 Automata on Lempel-Ziv Compressed Strings
  33. Altmetric Badge
    Chapter 32 Complexity of Some Problems in Modal and Intuitionistic Calculi
  34. Altmetric Badge
    Chapter 33 Goal-Directed Calculi for Gödel-Dummett Logics
  35. Altmetric Badge
    Chapter 34 A Logic for Probability in Quantum Systems
  36. Altmetric Badge
    Chapter 35 A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
  37. Altmetric Badge
    Chapter 36 The Epsilon Calculus
  38. Altmetric Badge
    Chapter 37 Modular Semantics and Logics of Classes
  39. Altmetric Badge
    Chapter 38 Validity of CTL Queries Revisited
  40. Altmetric Badge
    Chapter 39 Calculi of Meta-variables
  41. Altmetric Badge
    Chapter 40 Henkin Models of the Partial λ-Calculus
  42. Altmetric Badge
    Chapter 41 Computer Science Logic
  43. Altmetric Badge
    Chapter 42 Friends or Foes? Communities in Software Verification
  44. Altmetric Badge
    Chapter 43 More Computation Power for a Denotational Semantics for First Order Logic
  45. Altmetric Badge
    Chapter 44 Effective Model Completeness of the Theory of Restricted Pfaffian Functions
  46. Altmetric Badge
    Chapter 45 Effective Quantifier Elimination over Real Closed Fields
  47. Altmetric Badge
    Chapter 46 Fast Infinite-State Model Checking in Integer-Based Systems
  48. Altmetric Badge
    Chapter 47 Winning Strategies and Synthesis of Controllers
  49. Altmetric Badge
    Chapter 48 Logical Relations for Dynamic Name Creation
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user

Readers on

mendeley
7 Mendeley
Summary X
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 Science & Business Media, August 2003
DOI 10.1007/b13224
ISBNs
978-3-54-040801-7, 978-3-54-045220-1
Editors

Matthias Baaz, Johann A. Makowsky

View on publisher site Google Preview
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 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United Kingdom 1 14%
Unknown 6 86%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 43%
Student > Master 1 14%
Professor 1 14%
Researcher 1 14%
Professor > Associate Professor 1 14%
Other 0 0%
Readers by discipline Count As %
Computer Science 6 86%
Engineering 1 14%

This page is provided by Altmetric.