Artículos relacionados a First-Order Logic and Automated Theorem Proving (Texts...
Sinopsis
Book by Fitting Melvin
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
Reseña del editor
This graduate-level text presents fundamental concepts and results of classical logic in a rigorous mathematical style. Applications to automated theorem proving are considered and usable Prolog programs provided. It will serve both as a first text in formal logic and an introduction to automation issues for students in computer science or mathematics. The book treats propositional logic, first-order logic, and first-order logic with equality. In each case the initial presentation is semantic, to define the intended subjects independently of the choice of proof mechanism. Then many kinds of proof procedure are introduced. Results such as completeness, compactness, and interpolation are established, and theorem provers are implemented in Prolog. This new edition includes material on AE calculus, Herbrand's Theorem, Gentzen's Theorem, and related topics.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer-Verlag New York Inc.
- Año de publicación1995
- ISBN 10 0387945938
- ISBN 13 9780387945934
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas344
EUR 54,07
EUR 9,00 gastos de envío desde Alemania a Estados Unidos de America
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para First-Order Logic and Automated Theorem Proving (Texts...
Imagen de archivo
First-Order Logic and Automated Theorem Proving (Texts in Computer Science)
Librería: medimops, Berlin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. Nº de ref. del artículo: M00387945938-G
Gastos de envío:
EUR 9,00
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
First-Order Logic and Automated Theorem Proving (Texts in Computer Science)
Librería: Night Heron Books, Laramie, WY, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
hardcover. Condición: Very Good. Binding tight.Cover clean.Minor wear to page edges and corners. Hardcover.No writing, highlighting, or marks in text. Nº de ref. del artículo: 763988
Cantidad disponible: 1 disponibles