Skip to main content
SpringerLink
Log in

Mathematical Logic for Computer Science

  • Textbook
  • © 2001

Overview

Authors:
  1. Mordechai Ben-Ari

    1. Department of Science Teaching, Weizmann Institute of Science, Rehovot, Israel

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Gives a rigorous grounding in mathematical logic, using techniques that are appropriate for computer science students and less abstract than books for mathematics students
  • Content includes topics that are rarely used except in computer science (temporal logic, resolution)
  • Applications for computer science are extensively discussed after the theory is presented
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 chapters)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. Introduction

    • Mordechai Ben-Ari
    Pages 1-7

  3. Propositional Calculus: Formulas, Models, Tableaux

    • Mordechai Ben-Ari
    Pages 9-41

  4. Propositional Calculus: Deductive Systems

    • Mordechai Ben-Ari
    Pages 43-65

  5. Propositional Calculus: Resolution and BDDs

    • Mordechai Ben-Ari
    Pages 67-100

  6. Predicate Calculus: Formulas, Models, Tableaux

    • Mordechai Ben-Ari
    Pages 101-126

  7. Predicate Calculus: Deductive Systems

    • Mordechai Ben-Ari
    Pages 127-138

  8. Predicate Calculus: Resolution

    • Mordechai Ben-Ari
    Pages 139-172

  9. Logic Programming

    • Mordechai Ben-Ari
    Pages 173-200

  10. Programs: Semantics and Verification

    • Mordechai Ben-Ari
    Pages 201-220

  11. Programs: Formal specification with Z

    • Mordechai Ben-Ari
    Pages 221-234

  12. Temporal Logic: Formulas, Models, Tableaux

    • Mordechai Ben-Ari
    Pages 235-256

  13. Temporal Logic: Deduction and Applications

    • Mordechai Ben-Ari
    Pages 257-282

  14. Back Matter

    Pages 283-304
    Download chapter PDF
Back to top

Keywords

About this book

Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of computer science students. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and yet sufficiently elementary for undergraduates. To provide a balanced treatment of logic, tableaux are related to deductive proof systems.
The logical systems presented are:
- Propositional calculus (including binary decision diagrams);
- Predicate calculus;
- Resolution;
- Hoare logic;
- Z;
- Temporal logic.
Answers to exercises (for instructors only) as well as Prolog source code for algorithms may be found via the Springer London web site: http://www.springer.com/978-1-85233-319-5  

Mordechai Ben-Ari is an associate professor in the Department of Science Teaching of the Weizmann Institute of Science. He is the author of numerous textbooks on concurrency,programming languages and logic, and has developed software tools for teaching concurrency. In 2004, Ben-Ari received the ACM/SIGCSE Award for Outstanding Contributions to Computer Science Education.

Authors and Affiliations

  • Department of Science Teaching, Weizmann Institute of Science, Rehovot, Israel

    Mordechai Ben-Ari

About the author

 

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation