Deduction Systems (Graduate Texts in Computer Science) - Tapa dura

Libro 24 de 83: Texts in Computer Science

Socher-Ambrosius, R.; Johann, P.

 
9780387948478: Deduction Systems (Graduate Texts in Computer Science)
Tapa dura
ISBN 10: 0387948473 ISBN 13: 9780387948478
Editorial: Springer-Verlag New York Inc., 1996

Sinopsis

This graduate-level text offers a theoretical treatment of the fundamental concepts and methods of automated deduction. By presenting an account which covers resolution theorem-proving in order-sorted first-order logic it provides a self-contained account suitable for students coming to the subject for the first time. Both Gentzen-style sequent calculi and the refutation method known as resolution are treated in detail. Various strategies for pruning resolution search spaces, such as linear, hyper- and ordered resolution are covered. Numerous examples are presented to illustrate the examples discussed. As a result students will find this a readily accessible introduction to this subject.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

The idea of mechanizing deductive reasoning can be traced all the way back to Leibniz, who proposed the development of a rational calculus for this purpose. But it was not until the appearance of Frege's 1879 Begriffsschrift-"not only the direct ancestor of contemporary systems of mathematical logic, but also the ancestor of all formal languages, including computer programming languages" ([Dav83])-that the fundamental concepts of modern mathematical logic were developed. Whitehead and Russell showed in their Principia Mathematica that the entirety of classical mathematics can be developed within the framework of a formal calculus, and in 1930, Skolem, Herbrand, and Godel demonstrated that the first-order predicate calculus (which is such a calculus) is complete, i. e. , that every valid formula in the language of the predicate calculus is derivable from its axioms. Skolem, Herbrand, and GOdel further proved that in order to mechanize reasoning within the predicate calculus, it suffices to Herbrand consider only interpretations of formulae over their associated universes. We will see that the upshot of this discovery is that the validity of a formula in the predicate calculus can be deduced from the structure of its constituents, so that a machine might perform the logical inferences required to determine its validity. With the advent of computers in the 1950s there developed an interest in automatic theorem proving.

Reseña del editor

This graduate-level text offers a theoretical treatment of the fundamental concepts and methods of automated deduction. By presenting an account which covers resolution theorem-proving in order-sorted first-order logic it provides a self-contained account suitable for students coming to the subject for the first time. Both Gentzen-style sequent calculi and the refutation method known as resolution are treated in detail. Various strategies for pruning resolution search spaces, such as linear, hyper- and ordered resolution are covered. Numerous examples are presented to illustrate the examples discussed. As a result students will find this a readily accessible introduction to this subject.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer-Verlag New York Inc.
Año de publicación
1996
Idioma
Inglés
ISBN 10 
0387948473
ISBN 13 
9780387948478
Encuadernación
Tapa dura
Número de páginas
218
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9781461274797: Deduction Systems (Texts in Computer Science)

Edición Destacada

ISBN 10:  1461274796 ISBN 13:  9781461274797
Editorial: Springer, 2011
Tapa blanda