↓ 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 A universal Turing machine
  3. Altmetric Badge
    Chapter 2 Recursive inseparability in linear logic
  4. Altmetric Badge
    Chapter 3 The basic logic of proofs
  5. Altmetric Badge
    Chapter 4 Algorithmic structuring of cut-free proofs
  6. Altmetric Badge
    Chapter 5 Optimization problems: Expressibility, approximation properties and expected asymptotic growth of optimal solutions
  7. Altmetric Badge
    Chapter 6 Linear λ-calculus and categorical models revisited
  8. Altmetric Badge
    Chapter 7 A self-interpreter of lambda calculus having a normal form
  9. Altmetric Badge
    Chapter 8 An “Ehrenfeucht-Fraïssé game” for fixpoint logic and stratified fixpoint logic
  10. Altmetric Badge
    Chapter 9 The class of problems that are linearly equivalent to satisfiability or a uniform method for proving NP-completeness
  11. Altmetric Badge
    Chapter 10 Model building by resolution
  12. Altmetric Badge
    Chapter 11 Comparative transition system semantics
  13. Altmetric Badge
    Chapter 12 Reasoning with higher order partial functions
  14. Altmetric Badge
    Chapter 13 Communicating evolving algebras
  15. Altmetric Badge
    Chapter 14 On the completeness of narrowing as the operational semantics of functional logic programming
  16. Altmetric Badge
    Chapter 15 Inductive definability with counting on finite structures
  17. Altmetric Badge
    Chapter 16 Linear time algorithms and NP-complete problems
  18. Altmetric Badge
    Chapter 17 The semantics of the C programming language
  19. Altmetric Badge
    Chapter 18 A theory of classes for a functional language with effects
  20. Altmetric Badge
    Chapter 19 Logical definability of NP-optimisation problems with monadic auxiliary predicates
  21. Altmetric Badge
    Chapter 20 Universes in the theories of types and names
  22. Altmetric Badge
    Chapter 21 Notes on sconing and relators
  23. Altmetric Badge
    Chapter 22 Solving 3-satisfiability in less than 1, 579 n steps
  24. Altmetric Badge
    Chapter 23 Kleene's slash and existence of values of open terms in type theory
  25. Altmetric Badge
    Chapter 24 Negation-complete logic programs
  26. Altmetric Badge
    Chapter 25 Logical characterization of bounded query classes II: Polynomial-time oracle machines
  27. Altmetric Badge
    Chapter 26 On asymptotic probabilities of monadic second order properties
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

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.
Title
Computer Science Logic
Published by
Springer Science & Business Media, January 1993
DOI 10.1007/3-540-56992-8
ISBNs
978-3-54-056992-3, 978-3-54-047890-4
Editors

Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M. M.

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 %
France 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Professor 2 100%
Other 1 50%
Student > Ph. D. Student 1 50%
Professor > Associate Professor 1 50%
Readers by discipline Count As %
Computer Science 4 200%
Mathematics 1 50%