↓ 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 Functorial Boxes in String Diagrams
  3. Altmetric Badge
    Chapter 2 Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract)
  4. Altmetric Badge
    Chapter 3 Automata and Logics for Words and Trees over an Infinite Alphabet
  5. Altmetric Badge
    Chapter 4 Nonmonotonic Logics and Their Algebraic Foundations
  6. Altmetric Badge
    Chapter 5 Semi-continuous Sized Types and Termination
  7. Altmetric Badge
    Chapter 6 Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
  8. Altmetric Badge
    Chapter 7 A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata
  9. Altmetric Badge
    Chapter 8 The Power of Linear Functions
  10. Altmetric Badge
    Chapter 9 Logical Omniscience Via Proof Complexity
  11. Altmetric Badge
    Chapter 10 Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
  12. Altmetric Badge
    Chapter 11 MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
  13. Altmetric Badge
    Chapter 12 Abstracting Allocation
  14. Altmetric Badge
    Chapter 13 Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
  15. Altmetric Badge
    Chapter 14 Towards an Implicit Characterization of NC k
  16. Altmetric Badge
    Chapter 15 On Rational Trees
  17. Altmetric Badge
    Chapter 16 Reasoning About States of Probabilistic Sequential Programs
  18. Altmetric Badge
    Chapter 17 Concurrent Games with Tail Objectives
  19. Altmetric Badge
    Chapter 18 Nash Equilibrium for Upward-Closed Objectives
  20. Altmetric Badge
    Chapter 19 Algorithms for Omega-Regular Games with Imperfect Information
  21. Altmetric Badge
    Chapter 20 Relating Two Standard Notions of Secrecy
  22. Altmetric Badge
    Chapter 21 Jump from Parallel to Sequential Proofs: Multiplicatives
  23. Altmetric Badge
    Chapter 22 First-Order Queries over One Unary Function
  24. Altmetric Badge
    Chapter 23 Infinite State Model-Checking of Propositional Dynamic Logics
  25. Altmetric Badge
    Chapter 24 Weak Bisimulation Approximants
  26. Altmetric Badge
    Chapter 25 Complete Problems for Higher Order Logics
  27. Altmetric Badge
    Chapter 26 Solving Games Without Determinization
  28. Altmetric Badge
    Chapter 27 Game Quantification on Automatic Structures and Hierarchical Model Checking Games
  29. Altmetric Badge
    Chapter 28 An Algebraic Point of View on the Crane Beach Property
  30. Altmetric Badge
    Chapter 29 A Sequent Calculus for Type Theory
  31. Altmetric Badge
    Chapter 30 Universality Results for Models in Locally Boolean Domains
  32. Altmetric Badge
    Chapter 31 Universal Structures and the Logic of Forbidden Patterns
  33. Altmetric Badge
    Chapter 32 On the Expressive Power of Graph Logic
  34. Altmetric Badge
    Chapter 33 Hoare Logic in the Abstract
  35. Altmetric Badge
    Chapter 34 Normalization of IZF with Replacement
  36. Altmetric Badge
    Chapter 35 Acyclicity and Coherence in Multiplicative Exponential Linear Logic
  37. Altmetric Badge
    Chapter 36 Church Synthesis Problem with Parameters
  38. Altmetric Badge
    Chapter 37 Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
  39. Altmetric Badge
    Chapter 38 Separation Logic for Higher-Order Store
  40. Altmetric Badge
    Chapter 39 Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
  41. Altmetric Badge
    Chapter 40 Space-Efficient Computation by Interaction
  42. Altmetric Badge
    Chapter 41 The Ackermann Award 2006
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (68th percentile)
  • High Attention Score compared to outputs of the same age and source (81st percentile)

Mentioned by

1 tweeter
1 Wikipedia page
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.
Computer Science Logic
Published by
Lecture notes in computer science, January 2006
DOI 10.1007/11874683
978-3-54-045458-8, 978-3-54-045459-5

Zoltán Ésik


Ésik, Zoltán

Twitter Demographics

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

Attention Score in Context

This research output has an Altmetric Attention Score of 4. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 23 May 2019.
All research outputs
of 15,094,232 outputs
Outputs from Lecture notes in computer science
of 7,542 outputs
Outputs of similar age
of 267,389 outputs
Outputs of similar age from Lecture notes in computer science
of 197 outputs
Altmetric has tracked 15,094,232 research outputs across all sources so far. This one has received more attention than most of these and is in the 70th percentile.
So far Altmetric has tracked 7,542 research outputs from this source. They receive a mean Attention Score of 4.5. This one has gotten more attention than average, scoring higher than 72% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 267,389 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 68% of its contemporaries.
We're also able to compare this research output to 197 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 81% of its contemporaries.