Logic for Computer Scientists

  • Uwe Schöning

Part of the Progress in Mathematics book series (volume 8)

Table of contents

  1. Front Matter
    Pages i-xiii
  2. Pages 1-2
  3. Pages 3-39
  4. Pages 41-107
  5. Pages 109-154
  6. Back Matter
    Pages 155-166

About this book


This book introduces the notions and methods of formal logic from a computer science standpoint, covering propositional logic, predicate logic, and foundations of logic programming. It presents applications and themes of computer science research such as resolution, automated deduction, and logic programming in a rigorous but readable way.

The style and scope of the work, rounded out by the inclusion of exercises, make this an excellent textbook for an advanced undergraduate course in logic for computer scientists.


This is a short introductory book on the topic of propositional and first-order logic, with a bias towards computer scientists…. Schöning decides to concentrate on computational issues, and gives us a short book (less than 170 pages) with a tight storyline…. I found this a nicely written book with many examples and exercises (126 of them). The presentation is natural and easy to follow…. This book seems suitable for a short course, a seminar series, or part of a larger course on Prolog and logic programming, probably at the advanced undergraduate level.   — SIGACT News

Contains examples and 126 interesting exercises which put the student in an active reading mode.... Would provide a good university short course introducing computer science students to theorem proving and logic programming.   — Mathematical Reviews

This book concentrates on those aspects of mathematical logic which have strong connections with different topics in computer science, especially automated deduction, logic programming, program verification and semantics of programming languages.... The numerous exercises and illustrative examples contribute a great extent to a better understanding of different concepts and results. The book can be successfully used as a handbook for an introductory course in artificial intelligence.   — Zentralblatt MATH


Resolution artificial intelligence automated deduction automatic reduction computer science formal logic logic logic programming mathematical logic mathematics of computing predicate logic program verification programming language semantics theorem proving

Authors and affiliations

  • Uwe Schöning
    • 1
  1. 1.Abt. Theoretische InformatikUniversität UlmUlmGermany

Bibliographic information

Industry Sectors
IT & Software