| 書目名稱 | First-Order Logic and Automated Theorem Proving | | 編輯 | Melvin Fitting | | 視頻video | http://file.papertrans.cn/344/343864/343864.mp4 | | 叢書名稱 | Texts in Computer Science | | 圖書封面 |  | | 描述 | 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 | | 出版日期 | Textbook 1996Latest edition | | 關(guān)鍵詞 | Cut-elimination theorem; Resolution; Variable; automated theorem proving; calculus; complexity; computer; f | | 版次 | 2 | | doi | https://doi.org/10.1007/978-1-4612-2360-3 | | isbn_softcover | 978-1-4612-7515-2 | | isbn_ebook | 978-1-4612-2360-3Series ISSN 1868-0941 Series E-ISSN 1868-095X | | issn_series | 1868-0941 | | copyright | Springer Science+Business Media New York 1996 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 21:22
發(fā)表于 2025-3-21 17:13:05
