• List Price: $72.95
  • Save: $45.71 (63%)
Rented from RentU
To Rent, select Shipping State from options above
Due Date: Dec 20, 2014
FREE return shipping at the end of the semester. Access codes and supplements are not guaranteed with rentals.
Qty:1
  • List Price: $72.95
  • Save: $4.35 (6%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Trade in your item
Get a $2.00
Gift Card.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) Hardcover – June 11, 1973

ISBN-13: 978-0121703509 ISBN-10: 0121703509 Edition: 1st

Buy New
Price: $68.60
Rent
Price: $27.24
22 New from $56.72 31 Used from $2.79
Amazon Price New from Used from
Hardcover
"Please retry"
$68.60
$56.72 $2.79
Paperback
"Please retry"

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student



Frequently Bought Together

Symbolic Logic and Mechanical Theorem Proving (Computer Science and Applied Mathematics) + Implementing Programming Languages. an Introduction to Compilers and Interpreters (Texts in Computing)
Price for both: $84.80

Buy the selected items together

NO_CONTENT_IN_FEATURE

Save up to 90% on Textbooks
Rent textbooks, buy textbooks, or get up to 80% back when you sell us your books. Shop Now

Product Details

  • Series: Computer Science and Applied Mathematics
  • Hardcover: 331 pages
  • Publisher: Academic Press; 1 edition (June 11, 1973)
  • Language: English
  • ISBN-10: 0121703509
  • ISBN-13: 978-0121703509
  • Product Dimensions: 1 x 6.3 x 9.2 inches
  • Shipping Weight: 1.7 pounds (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #1,029,036 in Books (See Top 100 in Books)

Editorial Reviews

From the Back Cover

Mechanical theorem proving is an important subject in artificial intelligence. It has been applied to many areas--program analysis, program synthesis, deductive question-answering systems, problem-solving systems, and robot technology.
This classic text provides a thorough discussion of mechanical theorem proving and its applications as well as an introduction to symbolic logic. A purely model-theoretic approach to first-order logic is adopted, and the book emphasizes efficient computer implementations of proof techniques.
Appropriate for both undergraduates and graduate courses in theorem proving, this text is also suitable as a supplementary textbook in artificial intelligence to provide the student with a background in mechanical theorem proving and application areas.

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

5.0 out of 5 stars
5 star
4
4 star
0
3 star
0
2 star
0
1 star
0
See all 4 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

9 of 9 people found the following review helpful By M. Rumore on October 11, 2000
Format: Hardcover
Best introductory book on automated theorem proving available. Although it was written in the early 70's, it is written in a very clear, but mathematically precise, manner. It does not drown a reader with an abundance of symbols and definitions. It is a clear and well written exposition on automated theorem proving based on resolution. Unlike some recent text books, it does NOT use sequentzen logic systems. It covers all aspects of resolution-based theorem proving: different forms of resolution, deletion strategies, unification.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
7 of 8 people found the following review helpful By hmpiloni@compuserve.com.mx on November 26, 1998
Format: Hardcover
If you are interested in Artificial Intelligence or you are one of those crazy guys who likes the Computer theory area this is a good book for you, mechanical theorem proving is an important subject into the AI area, all you want to know is Mathematical Logic, first order logic and predicate calculus. Very good book but very hard too (specially if you have to make some Mechanical theorem provers by yourself as a school project :) )
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By King Yin Yan on October 3, 2010
Format: Hardcover
If you're a beginner who wants to build a FOL theorem prover, this is the first book you must get. The exposition is exemplary in clarity.

Though published in 1973, the material is not outdated. Many newer books talk about essentially the same basics, only harder to read.

It also explains answer extraction (ie, how to answer "what", "where", "when", "who" questions via resolution and unification).
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
1 of 1 people found the following review helpful By Richard Rast on April 10, 2008
Format: Hardcover
This book provides a complete introduction to mechanical theorem proving, including a lesson in both predicate calculus and first order logic. It is also profoundly readable.

Each concept is presented intuitively, abstractly (rigorously), then practically. Every technique and virtually every definition is proceeded by an example in both predicate calculus and first order logic, the first to show its simplicity, and the second to show its power. Proofs of the validity and completeness of every technique are provided to satisfy any concerns about them (and to interest theorists), but are not essential for comprehension of the book. Furthermore, the algorithms are all presented in a mathematically rigorous way, yet in a way that is quickly implemented on a computer.

In short, this book contains everything you need, whether you are interested in the subject or actually want/need to build a theorem prover. Furthermore, it's made as easy as the concepts can possibly be, and very rarely do you have to re-read a section to understand. This is the perfect book on the subject.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images

Search

What Other Items Do Customers Buy After Viewing This Item?