A compendium of logic and computation
Dana Richards’s 476-page compendium connects logic and automata theory with practical concerns in computer science, including loop invariants, program correctness, logic programming, and algorithmic proof techniques. Its material is organized in an order the publisher distinguishes from standard textbooks, with fewer theorems and simpler proofs. The fourth edition adds examples, problems, and answers, making the book both a broad reference across these topics and a resource for working through exercises. The publisher also describes it as suitable for undergraduate use at many universities.
Good fit for readers who enjoy
- Undergraduate students studying logic, automata theory, or theoretical computer science
- Readers seeking a reference that links computation theory to programming and algorithms
- Instructors looking for a text with examples, problems, and answers
Themes
Theory of computationLogic and automata theoryProgram correctnessAlgorithmic proof techniques
Based on publisher information and book metadata.