↓ 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 XML Navigation and Tarski’s Relation Algebras
  3. Altmetric Badge
    Chapter 2 Verification in Predicate Logic with Time: Algorithmic Questions
  4. Altmetric Badge
    Chapter 3 Note on Formal Analogical Reasoning in the Juridical Context
  5. Altmetric Badge
    Chapter 4 An Abstract Strong Normalization Theorem
  6. Altmetric Badge
    Chapter 5 On Bunched Polymorphism
  7. Altmetric Badge
    Chapter 6 Distributed Control Flow with Classical Modal Logic
  8. Altmetric Badge
    Chapter 7 A Logic of Coequations
  9. Altmetric Badge
    Chapter 8 A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage
  10. Altmetric Badge
    Chapter 9 Order Structures on Böhm-Like Models
  11. Altmetric Badge
    Chapter 10 Higher-Order Matching and Games
  12. Altmetric Badge
    Chapter 11 Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size Annotations
  13. Altmetric Badge
    Chapter 12 On the Role of Type Decorations in the Calculus of Inductive Constructions
  14. Altmetric Badge
    Chapter 13 L-Nets, Strategies and Proof-Nets
  15. Altmetric Badge
    Chapter 14 Permutative Logic
  16. Altmetric Badge
    Chapter 15 Focusing the Inverse Method for Linear Logic
  17. Altmetric Badge
    Chapter 16 Towards a Typed Geometry of Interaction
  18. Altmetric Badge
    Chapter 17 From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction
  19. Altmetric Badge
    Chapter 18 An Algebraic Approach for the Unsatisfiability of Nonlinear Constraints
  20. Altmetric Badge
    Chapter 19 Coprimality in Finite Models
  21. Altmetric Badge
    Chapter 20 Towards a Characterization of Order-Invariant Queries over Tame Structures
  22. Altmetric Badge
    Chapter 21 Decidability of Term Algebras Extending Partial Algebras
  23. Altmetric Badge
    Chapter 22 Results on the Guarded Fragment with Equivalence or Transitive Relations
  24. Altmetric Badge
    Chapter 23 The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
  25. Altmetric Badge
    Chapter 24 On the Complexity of Hybrid Logics with Binders
  26. Altmetric Badge
    Chapter 25 The Complexity of Independence-Friendly Fixpoint Logic
  27. Altmetric Badge
    Chapter 26 Closure Properties of Weak Systems of Bounded Arithmetic
  28. Altmetric Badge
    Chapter 27 Transfinite Extension of the Mu-Calculus
  29. Altmetric Badge
    Chapter 28 Bounded Model Checking of Pointer Programs
  30. Altmetric Badge
    Chapter 29 PDL with Intersection and Converse Is Decidable
  31. Altmetric Badge
    Chapter 30 On Deciding Topological Classes of Deterministic Tree Languages
  32. Altmetric Badge
    Chapter 31 Complexity and Intensionality in a Type-1 Framework for Computable Analysis
  33. Altmetric Badge
    Chapter 32 Computing with Sequences, Weak Topologies and the Axiom of Choice
  34. Altmetric Badge
    Chapter 33 Light Functional Interpretation
  35. Altmetric Badge
    Chapter 34 Feasible Proofs of Matrix Properties with Csanky’s Algorithm
  36. Altmetric Badge
    Chapter 35 A Propositional Proof System for Log Space
  37. Altmetric Badge
    Chapter 36 Identifying Polynomial-Time Recursive Functions
  38. Altmetric Badge
    Chapter 37 Confluence of Shallow Right-Linear Rewrite Systems
  39. Altmetric Badge
    Chapter 38 The Ackermann Award 2005
  40. Altmetric Badge
    Chapter 39 Clemens Lautemann: 1951-2005 An Obituary
Attention for Chapter 20: Towards a Characterization of Order-Invariant Queries over Tame Structures
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 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.
Chapter title
Towards a Characterization of Order-Invariant Queries over Tame Structures
Chapter number 20
Book title
Computer Science Logic
Published by
Springer, Berlin, Heidelberg, August 2005
DOI 10.1007/11538363_20
Book ISBNs
978-3-54-028231-0, 978-3-54-031897-2
Authors

Michael Benedikt, Luc Segoufin, Benedikt, Michael, Segoufin, Luc

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Doctoral Student 1 50%
Unknown 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Unknown 1 50%