First-Order Logic and Automated Theorem Proving (Texts in Computer Science) 2nd Edition

by Melvin Fitting (Author)

2 customer reviews

ISBN-13: 978-0387945934

ISBN-10: 0387945938

Why is ISBN important?

Sell yours for a Gift Card
We'll buy it for $4.37
Learn More
Trade in now

Have one to sell? Sell on Amazon

Try the eTextbook for free Get it now

$0.00

Try the eTextbook free for 7 days on your Fire, iOS, Android, PC, or Mac once you have installed the

eTextbook features:

Highlight, take notes, and search in the book
Page numbers are just like the physical edition
Create digital flashcards instantly

More Buying Choices

5 New from $200.00 12 Used from $73.99

17 used & new from $73.99

See All Buying Options

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

There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scien tists. Although there is a common core to all such books, they will be very different in emphasis, methods, and even appearance. This book is intended for computer scientists. But even this is not precise. Within computer science formal logic turns up in a number of areas, from pro gram verification to logic programming to artificial intelligence. This book is intended for computer scientists interested in automated theo rem proving in classical logic. To be more precise yet, it is essentially a theoretical treatment, not a how-to book, although how-to issues are not neglected. This does not mean, of course, that the book will be of no interest to philosophers or mathematicians. It does contain a thorough presentation of formal logic and many proof techniques, and as such it contains all the material one would expect to find in a course in formal logic covering completeness but, not incompleteness issues. The first item to be addressed is, What are we talking about and why are we interested in it? We are primarily talking about truth as used in mathematical discourse, and our interest in it is, or should be, self evident. Truth is a semantic concept, so we begin with models and their properties. These are used to define our subject.

First-Order Logic and Automated Theorem Proving (Texts in Computer Science)

Available from these sellers.

Customers Who Viewed This Item Also Viewed

Page 1 of 1 Start overPage 1 of 1

This shopping feature will continue to load items. In order to navigate out of this carousel please use your heading shortcut key to navigate to the next or previous heading.

Jean H. Gallier

2

Paperback
$26.40
Ian Chiswell

4

Paperback
$59.43
M. Fitting
Hardcover
$169.00
Monty Newborn

1

Hardcover
$209.00

Customers Viewing This Page May Be Interested In These Sponsored Links

(What's this?)

1. Study Computer Science

MSc degrees, international faculty University of Lugano, Switzerland

www.master.usi.ch/

Ad feedback

NO_CONTENT_IN_FEATURE

Product Details

Series: Texts in Computer Science
Hardcover: 326 pages
Publisher: Springer; 2nd edition (November 29, 1995)
Language: English
ISBN-10: 0387945938
ISBN-13: 978-0387945934
Product Dimensions: 9.2 x 6.1 x 0.9 inches
Shipping Weight: 1.6 pounds
Average Customer Review: 4.0 out of 5 stars See all reviews (2 customer reviews)
Amazon Best Sellers Rank: #1,602,039 in Books (See Top 100 in Books)
- #261 in Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Logic
- #709 in Books > Science & Math > Mathematics > Pure Mathematics > Logic
- #4591 in Books > Computers & Technology > Hardware & DIY

Would you like to update product info or give feedback on images?

Customer Reviews

4.0 out of 5 stars

5 star		50%
4 star		0%
3 star		50%
2 star		0%
1 star		0%

See both customer reviews

Share your thoughts with other customers

Write a customer review

Top Customer Reviews

This is the book I was looking for

By Timothy Robinson on November 3, 2009

Format: Hardcover

A comprehensive and practical book on formal systems. All the proofs are here, which will please mathematicians, and there is enough working Prolog code to satisfy the computer scientists. If the proofs don't interest you, skip them. The definitions are clear and there are plenty of useful examples - just what is missing from all those Axiomatic Set Theory books.

Comment 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...

Thank you for your feedback.

Sorry, we failed to record your vote. Please try again

Report abuse

Good book, but a little tough to read

By Michael Paul Holmes on July 26, 2006