Computer Science Logic

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 The Computability Path Ordering: The End of a Quest
3. Altmetric Badge
   Chapter 2 The Joy of String Diagrams
4. Altmetric Badge
   Chapter 3 Model Transformations in Decidability Proofs for Monadic Theories
5. Altmetric Badge
   Chapter 4 Molecules as Automata
6. Altmetric Badge
   Chapter 5 An Infinite Automaton Characterization of Double Exponential Time
7. Altmetric Badge
   Chapter 6 Recursion Schemata for NC k
8. Altmetric Badge
   Chapter 7 Extensional Uniformity for Boolean Circuits
9. Altmetric Badge
   Chapter 8 Pure Pointer Programs with Iteration
10. Altmetric Badge
    Chapter 9 Quantified Positive Temporal Constraints
11. Altmetric Badge
    Chapter 10 Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
12. Altmetric Badge
    Chapter 11 Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars
13. Altmetric Badge
    Chapter 12 Continuous Fragment of the mu-Calculus
14. Altmetric Badge
    Chapter 13 On the Relations between the Syntactic Theories of λμ-Calculi
15. Altmetric Badge
    Chapter 14 A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
16. Altmetric Badge
    Chapter 15 Proving Infinitude of Prime Numbers Using Binomial Coefficients
17. Altmetric Badge
    Chapter 16 A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
18. Altmetric Badge
    Chapter 17 A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract)
19. Altmetric Badge
    Chapter 18 Quantitative Game Semantics for Linear Logic
20. Altmetric Badge
    Chapter 19 A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
21. Altmetric Badge
    Chapter 20 An Indexed System for Multiplicative Additive Polarized Linear Logic
22. Altmetric Badge
    Chapter 21 A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
23. Altmetric Badge
    Chapter 22 Superposition for Fixed Domains
24. Altmetric Badge
    Chapter 23 Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
25. Altmetric Badge
    Chapter 24 On the Almighty Wand
26. Altmetric Badge
    Chapter 25 On Counting Generalized Colorings
27. Altmetric Badge
    Chapter 26 The Descriptive Complexity of Parity Games
28. Altmetric Badge
    Chapter 27 Computer Science Logic
29. Altmetric Badge
    Chapter 28 Quantitative Languages
30. Altmetric Badge
    Chapter 29 Characterization of Logics over Ranked Tree Languages
31. Altmetric Badge
    Chapter 30 The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
32. Altmetric Badge
    Chapter 31 Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)
33. Altmetric Badge
    Chapter 32 Syntactic Metatheory of Higher-Order Subtyping
34. Altmetric Badge
    Chapter 33 On Isomorphisms of Intersection Types
35. Altmetric Badge
    Chapter 34 Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
36. Altmetric Badge
    Chapter 35 Type-Based Termination with Sized Products
37. Altmetric Badge
    Chapter 36 The Ackermann Award 2008