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.
Категории:
Год:
2015
Издание:
2
Издательство:
Dover Publications
Язык:
english
ISBN 10:
0486805085
ISBN 13:
9780486805085
Серия:
Dover Books on Computer Science
Файл:
EPUB, 64.24 MB
IPFS:
,
english, 2015
Amazon 
Barnes & Noble 
Bookshop.org
Хотите добавить книжный магазин? Свяжитесь с нами по support@z-lib.do
Конвертируйте файлы
Больше результатов поиска
Другие преимущества 
![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)
Ключевые слова
Связанные Подборки
