Logic for Applications, 2nd

Nerode, Anil, and Shore, Richard A

ISBN 10: 0387948937 / ISBN 13: 9780387948935

Edité par Springer, New York, NY, 1997

A propos de cet article

***INTERNATIONAL EDITION*** Read carefully before purchase: This book is the international edition in mint condition with the different ISBN and book cover design, the major content is printed in full English as same as the original North American edition. The book printed in black and white, generally send in twenty-four hours after the order confirmed. All shipments contain tracking numbers. Great professional textbook selling experience and expedite shipping service. Sewn binding. Cloth over boards. 469 p. Contains: Illustrations. Graduate Texts in Computer Science. Audience: General/trade.

N° de réf. du vendeur K1080000230

Détails bibliographiques

• Titre: Logic for Applications, 2nd
• Éditeur: Springer, New York, NY
• Date de parution: 1997
• Langue: anglais
• ISBN à 10 chiffres: 0387948937
• ISBN à 13 chiffres: 9780387948935
• Reliure: Trade paperback
• Édition: 2nd ed.
• État de l'article: New in new dust jacket.

A propos de ce titre

Synopsis

In writing this book, our goal was to produce a text suitable for a first course in mathematical logic more attuned than the traditional textbooks to the re- cent dramatic growth in the applications oflogic to computer science. Thus, our choice oftopics has been heavily influenced by such applications. Of course, we cover the basic traditional topics: syntax, semantics, soundnes5, completeness and compactness as well as a few more advanced results such as the theorems of Skolem-Lowenheim and Herbrand. Much ofour book, however, deals with other less traditional topics. Resolution theorem proving plays a major role in our treatment of logic especially in its application to Logic Programming and PRO- LOG. We deal extensively with the mathematical foundations ofall three ofthese subjects. In addition, we include two chapters on nonclassical logics - modal and intuitionistic - that are becoming increasingly important in computer sci- ence. We develop the basic material on the syntax and semantics (via Kripke frames) for each of these logics. In both cases, our approach to formal proofs, soundness and completeness uses modifications of the same tableau method in- troduced for classical logic. We indicate how it can easily be adapted to various other special types of modal logics. A number of more advanced topics (includ- ing nonmonotonic logic) are also briefly introduced both in the nonclassical logic chapters and in the material on Logic Programming and PROLOG.