↓ 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 The expressive power of transitive closure and 2-way multihead automata
  3. Altmetric Badge
    Chapter 2 Correctness proof for the WAM with types
  4. Altmetric Badge
    Chapter 3 Model checking of persistent Petri nets
  5. Altmetric Badge
    Chapter 4 Provability in TBLL: A decision procedure
  6. Altmetric Badge
    Chapter 5 How to implement first order formulas in local memory machine models
  7. Altmetric Badge
    Chapter 6 A new approach to abstract data types II computation on ADTs as ordinary computation
  8. Altmetric Badge
    Chapter 7 A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation
  9. Altmetric Badge
    Chapter 8 On bounded theories
  10. Altmetric Badge
    Chapter 9 The cutting plane proof system with bounded degree of falsity
  11. Altmetric Badge
    Chapter 10 Denotational versus declarative semantics for functional programming
  12. Altmetric Badge
    Chapter 11 On transitive closure logic
  13. Altmetric Badge
    Chapter 12 Some aspects of the probabilistic behavior of variants of resolution
  14. Altmetric Badge
    Chapter 13 Safe queries in relational databases with functions
  15. Altmetric Badge
    Chapter 14 Logical inference and polyhedral projection
  16. Altmetric Badge
    Chapter 15 Stable logic
  17. Altmetric Badge
    Chapter 16 A transformational methodology for proving termination of logic programs
  18. Altmetric Badge
    Chapter 17 Plausibility logic
  19. Altmetric Badge
    Chapter 18 Towards Kleene Algebra with recursion
  20. Altmetric Badge
    Chapter 19 Equational specification of abstract types and combinators
  21. Altmetric Badge
    Chapter 20 Normal forms in infinite-valued logic: The case of one variable
  22. Altmetric Badge
    Chapter 21 A fragment of first order logic adequate for observation equivalence
  23. Altmetric Badge
    Chapter 22 Ordinal processes in comparative concurrency semantics
  24. Altmetric Badge
    Chapter 23 Logical semantics of modularisation
  25. Altmetric Badge
    Chapter 24 A cut-elimination procedure designed for evaluating proofs as programs
  26. Altmetric Badge
    Chapter 25 Minimal from classical proofs
  27. Altmetric Badge
    Chapter 26 Quantifier hierarchies over word relations
  28. Altmetric Badge
    Chapter 27 Complexity results for the default- and the autoepistemic logic
  29. Altmetric Badge
    Chapter 28 On Completeness for NP via projection translations
  30. Altmetric Badge
    Chapter 29 Control of ω-automata, Church's problem, and the emptiness problem for tree ω-automata
  31. Altmetric Badge
    Chapter 30 Comparing the theory of representations and constructive mathematics
  32. Altmetric Badge
    Chapter 31 Infinitary queries and their asymptotic probabilities I: Properties definable in transitive closure logic
  33. Altmetric Badge
    Chapter 32 Computer Science Logic
  34. Altmetric Badge
    Chapter 33 Proving termination for term rewriting systems
Attention for Chapter 18: Towards Kleene Algebra with recursion
Altmetric Badge

Mentioned by

twitter
2 X users

Readers on

mendeley
4 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.
Chapter title
Towards Kleene Algebra with recursion
Chapter number 18
Book title
Computer Science Logic
Published by
Springer, Berlin, Heidelberg, October 1991
DOI 10.1007/bfb0023771
Book ISBNs
978-3-54-055789-0, 978-3-54-047285-8
Authors

Haas Leiß

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users 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 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Belgium 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 50%
Researcher 2 50%
Readers by discipline Count As %
Computer Science 4 100%

This page is provided by Altmetric.