Addison-Wesley / Prentice Hall

Mathematics

Browse available resources for Mathematics:



Logic for Mathematics and Computer Science
Stanley N. Burris, University of Waterloo

ISBN-10: 0132859742
ISBN-13: 9780132859745

Publisher: Prentice Hall
Copyright: 1998
Format: Paper; 420 pp
Published: 08/18/1997

Suggested retail price: $73.33
Buy from myPearsonStore

This text is intended for one semester courses in Logic, it can also be applied to a two semester course, in either Computer Science or Mathematics Departments.

Unlike other texts on mathematical logic that are either too advanced, too sparse in examples or exercises, too traditional in coverage, or too philosophical in approach, this text provides an elementary "hands-on" presentation of important mathematical logic topics, new and old, that is readily accessible and relevant to all students of the mathematical sciences -- not just those in traditional pure mathematics.

  • Assumes no background in abstract algebra or analysis -- yet focuses clearly on mathematical logic: logic for mathematics and computer science that is developed and analyzed using mathematical methods. Pg.___
  • Explores topics that are at the cutting edge of developments in computer science, while preserving the integrity of traditional logic. Pg.___
  • Stresses that there are several self-contained proof systems of interest to mathematical logic -- some more suitable than others for particular kinds of questions. Pg.___
  • Presents elementary traditional logic side-by-side with its algorithmic aspects -- i.e., the syntax and semantics of first-order logic up to completeness and compactness, and developments in theorem proving that were inspired by the possibilities of using computers (e.g., Robinson's resolution theorem proving and the Knuth-Bendix procedure to obtain term rewrite systems.) Pg.___
  • Provides detailed explanations and examples throughout. Pg.___
  • Includes historical detail to tie concepts together. Pg.___
  • Features over 200 examples worked out in detail. Pg.___

    • Uses familiar examples to ease students into new material. Pg.___

  • Provides over 500 exercises. Pg.___
  • Contains two substantial worksheets on Peano's Axioms and the FL propositional logic. Pg.___
  • Offers supplementary materials on the internet -- where students can experience automated logical algorithms in action. Pg.___

I. QUANTIFIER-FREE LOGICS.

1. From Aristotle to Boole.

2. Propositional Logic.

3. Equational Logic.

4. Predicate Clause Logic.

II. LOGIC WITH QUANTIFIERS.

5. First-Order Logic: Introduction, and Fundamental Results on Semantics.

6. A Proof System for First-Order Logic and Gödel's Completeness Theorem.

Appendix A. A Simple Timetable of Mathematical Logic and Computing.

Appendix B. Dedekind-Peano Number System.

Appendix C. Writing Up an Inductive Definition or Proof.

Appendix D. FL Propositional Logic.

Bibliography.

Index.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson Higher Education representative for pricing and ordering information.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.


Copyright ©2008 Pearson Education. All rights reserved. Legal Notice | Privacy Policy | Permissions