Handbook of Logic and Proof Techniques for Computer Science
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Maths for computer scientists > Handbook of Logic and Proof Techniques for Computer Science
Handbook of Logic and Proof Techniques for Computer Science

Handbook of Logic and Proof Techniques for Computer Science


     0     
5
4
3
2
1



Available


X
About the Book

This handbook presents the elements of modern logic, including many current topics, to the reader having only basic mathematical literacy. Computer scientists will find specific examples and important ideas such as axiomatics, recursion theory, decidability, independence, completeness, consistency, model theory, and P/NP completeness. The book contains definitions, examples and discussion of all of the key ideas in basic logic, but also makes a special effort to cut through the mathematical formalism, difficult notation, and esoteric terminology that is typical of modern mathematical logic. The Handbook of Mathematical Logic and Proof Techniques delivers cogent and self-contained introductions to critical advanced topics, including: - Godel's completeness and incompleteness theorems - Methods of proof, cardinal and ordinal numbers, the continuum hypothesis, the axiom of choice, model theory, number systems and their construction - Extensive treatment of complexity theory and programming applications - Presents applications to algorithms in Boolean algebra - Provides a treatment of set theory and applications of logic

Table of Contents:
1 Notation and First-Order Logic.- 1.1 The Use of Connectives.- 1.2 Truth Values and Truth Tables.- 1.3 The Use of Quantifiers.- 1.4 Gödel’s Completeness Theorem.- 1.5 Second-Order Logic.- 2 Semantics and Syntax.- 2.1 Elementary Symbols.- 2.2 Well-Formed Formulas or wffs [Syntax].- 2.3 Free and Bound Variables (Syntax).- 2.4 The Semantics of First-Order Logic.- 3 Axiomatics and Formalism in Mathematics.- 3.1 Basic Elements.- 3.2 Models.- 3.3 Consistency.- 3.4 Gödel’s Incompleteness Theorem.- 3.5 Decidability and Undecidability.- 3.6 Independence.- 4 The Axioms of Set Theory.- 4.1 Introduction.- 4.2 Axioms and Discussion.- 4.3 Concluding Remarks.- 5 Elementary Set Theory.- 5.1 Set Notation.- 5.2 Sets, Subsets, and Elements.- 5.3 Binary Operations on Sets.- 5.4 Relations and Equivalence Relation.- 5.5 Equivalence Relations.- 5.6 Number Systems.- 5.7 Functions.- 5.8 Cardinal Numbers.- 5.9 A Word About Classes.- 5.10 Fuzzy Set Theory.- 5.11 The Lambda Calculus.- 5.12 Sequences.- 5.13 Bags.- 6 Recursive Functions.- 6.1 Introductory Remarks.- 6.2 Primitive Recursive Functions.- 6.3 General Recursive Functions.- 7 The Number Systems.- 7.1 The Natural Numbers.- 7.2 The Integers.- 7.3 The Rational Numbers.- 7.4 The Real Numbers.- 7.5 The Complex Numbers.- 7.6 The Quaternions.- 7.7 The Cayley Numbers.- 7.8 Nonstandard Analysis.- 8 Methods of Mathematical Proof.- 8.1 Axiomatics.- 8.2 Proof by Induction.- 8.3 Proof by Contradiction.- 8.4 Direct Proof.- 8.5 Other Methods of Proof.- 9 The Axiom of Choice.- 9.1 Enunciation of the Axiom.- 9.2 Examples of the Use of the Axiom of Choice.- 9.3 Consequences of the Axiom of Choice.- 9.4 Paradoxes.- 9.5 The Countable Axiom of Choice.- 9.6 Consistency of the Axiom of Choice.- 9.7 Independence of the Axiom of Choice.- 10 Proof Theory.-10.1 General Remarks.- 10.2 Cut Elimination.- 10.3 Propositional Resolution.- 10.4 Interpolation.- 10.5 Finite Type.- 10.6 Beth’s Definability Theorem.- 11 Category Theory.- 11.1 Introductory Remarks.- 11.2 Metacategories and Categories.- 12 Complexity Theory.- 12.1 Preliminary Remarks.- 12.2 Polynomial Complexity.- 12.3 Exponential Complexity.- 12.4 Two Tables for Complexity Theory.- 12.5 Problems of Class P.- 12.6 Problems of Class NP.- 12.7 NP-Completeness.- 12.8 Cook’s Theorem.- 12.9 Examples of NP-Complete Problems.- 12.10 More on P/NP.- 12.11 Descriptive Complexity Theory.- 13 Boolean Algebra.- 13.1 Description of Boolean Algebra.- 13.2 Axioms of Boolean Algebra.- 13.3 Theorems in Boolean Algebra.- 13.4 Illustration of the Use of Boolean Logic.- 14 The Word Problem.- 14.1 Introductory Remarks.- 14.2 What Is a Group?.- 14.3 What Is a Free Group?.- 14.4 The Word Problem.- 14.5 Relations and Generators.- 14.6 Amalgams.- 14.7 Description of the Word Problem.- List of Notation from Logic.- Glossary of Terms from Mathematical and Sentential Logic.- A Guide to the Literature.

Review :
"This is really what it promises to be--a good handbook: supple, self-contained, providing the necessary and sufficient working resources ... it is more than [one] expect[s]: the rigor of usefulness and conciseness exceeds or equals ... the pleasure of reading it." --Zentralblatt Math


Best Sellers


Product Details
  • ISBN-13: 9780817642204
  • Publisher: Birkhauser Boston Inc
  • Publisher Imprint: Birkhauser Boston Inc
  • Height: 235 mm
  • No of Pages: 245
  • Returnable: Y
  • ISBN-10: 081764220X
  • Publisher Date: 17 Jan 2002
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Handbook of Logic and Proof Techniques for Computer Science
Birkhauser Boston Inc -
Handbook of Logic and Proof Techniques for Computer Science
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Handbook of Logic and Proof Techniques for Computer Science

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!