Logic for Computer Science: Foundations of Automatic Theorem Proving
Jean H. Gallier
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving.
Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.
Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.
Kategorien:
Jahr:
2015
Auflage:
2
Verlag:
Dover Publications
Sprache:
english
ISBN 10:
0486805085
ISBN 13:
9780486805085
Serien:
Dover Books on Computer Science
Datei:
EPUB, 64.24 MB
IPFS:
,
english, 2015
Amazon 
Barnes & Noble 
Bookshop.org
Möchten Sie Ihren Buchladen hinzufügen? Kontaktieren Sie uns unter support@z-lib.do
Konvertieren Sie Dateien
Mehr Suchergebnisse
Andere Vorteile 
![J. Eldon Whitesitt [Whitesitt, J. Eldon] — Boolean Algebra and Its Applications (Dover Books on Computer Science)](https://s3proxy.cdn-zlib.se/covers200/collections/genesis/cec8dee3f7ae9a2eb7df4980bd2a780065efec7af69662b471fd54db6dc3b8f6.jpg)
Am meisten angefragte Begriffe
Verbundene Bücherlisten
