Logical Foundations of Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Topological semantics for hybrid systems
3. Altmetric Badge
   Chapter 2 Domain-free pure type systems
4. Altmetric Badge
   Chapter 3 Generic queries over quasi- o -minimal domains
5. Altmetric Badge
   Chapter 4 Towards computing distances between programs via Scott domains
6. Altmetric Badge
   Chapter 5 A safe recursion scheme for exponential time
7. Altmetric Badge
   Chapter 6 Finite model theory, universal algebra and graph grammars
8. Altmetric Badge
   Chapter 7 Complexity of query answering in logic databases with complex values
9. Altmetric Badge
   Chapter 8 Recognition of deductive data base stability
10. Altmetric Badge
    Chapter 9 The concurrency complexity for the Horn fragment of linear logic
11. Altmetric Badge
    Chapter 10 Studying algorithmic problems for free semi-groups and groups
12. Altmetric Badge
    Chapter 11 Learning small programs with additional information
13. Altmetric Badge
    Chapter 12 Cut elimination for the second order propositional logic with Hilbert's ε-symbol, extensionality, and full comprehension
14. Altmetric Badge
    Chapter 13 Finite bases of admissible rules for the logic S 5 2 C
15. Altmetric Badge
    Chapter 14 An algebraic correctness criterion for intuitionistic proof-nets
16. Altmetric Badge
    Chapter 15 Towards a theory of recursive structures
17. Altmetric Badge
    Chapter 16 On the complexity of prefix formulas in modal logic of subset spaces
18. Altmetric Badge
    Chapter 17 The undecidability of second order linear affine logic
19. Altmetric Badge
    Chapter 18 Operational logic of proofs with functionality condition on proof predicate
20. Altmetric Badge
    Chapter 19 On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets
21. Altmetric Badge
    Chapter 20 Functions for the general solution of parametric word equations
22. Altmetric Badge
    Chapter 21 A proof procedure for hereditary Harrop formulas with free equality
23. Altmetric Badge
    Chapter 22 Basic forward chaining construction for logic programs
24. Altmetric Badge
    Chapter 23 Decidability and undecidability of the halting problem on Turing machines, a survey
25. Altmetric Badge
    Chapter 24 Case study: Additive linear logic and lattices
26. Altmetric Badge
    Chapter 25 Some decision problems for traces
27. Altmetric Badge
    Chapter 26 Existential instantiation and strong normalization
28. Altmetric Badge
    Chapter 27 Models for the logic of proofs
29. Altmetric Badge
    Chapter 28 Interpretation of the full computation tree logic CTL * on sets of infinite sequences
30. Altmetric Badge
    Chapter 29 Type introduction for equational rewriting
31. Altmetric Badge
    Chapter 30 Capturing bisimulation-invariant Ptime
32. Altmetric Badge
    Chapter 31 Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic
33. Altmetric Badge
    Chapter 32 A decidable fragment of second order linear logic
34. Altmetric Badge
    Chapter 33 Some results on Propositional Dynamic Logic with fixed points
35. Altmetric Badge
    Chapter 34 Quasi-characteristic inference rules for modal logics
36. Altmetric Badge
    Chapter 35 Provability logic with operations on proofs
37. Altmetric Badge
    Chapter 36 Formal verification of logic programs: Foundations and implementation
38. Altmetric Badge
    Chapter 37 Unification of terms with term-indexed variables
39. Altmetric Badge
    Chapter 38 Back-forth equivalences for design of concurrent systems
40. Altmetric Badge
    Chapter 39 Association nets: An alternative formalization of common thinking
41. Altmetric Badge
    Chapter 40 Simulating η-expansions with Β-reductions in the second-order polymorphic λ-rcalculus
42. Altmetric Badge
    Chapter 41 Logical schemes for first order theories
43. Altmetric Badge
    Chapter 42 Verification of PLTL formulae by means of monotone disjunctive normal forms