𝔖 Scriptorium
✦   LIBER   ✦

📁

Logic for Computer Scientists (Modern Birkhäuser Classics)

✍ Scribed by Uwe Schöning


Publisher
Birkhäuser
Year
2008
Tongue
English
Leaves
179
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


By the development of new fields and applications, such as Automated Theorem Proving and Logic Programming, Logic has obtained a new and important role in Computer Science. The traditional mathematical way of dealing with Logic is in some respect not tailored for Computer Science - plications. This book emphasizes such Computer Science aspects in Logic. It arose from a series of lectures in 1986 and 1987 on Computer Science Logic at the EWH University in Koblenz, Germany. The goal of this l- ture series was to give the undergraduate student an early and theoretically well-founded access to modern applications of Logic in Computer Science. A minimal mathematical basis is required, such as an understanding of the notation and knowledge about the basic mathematical proof techniques induction). More sophisticated mathematical kno- edge not a precondition read this book. Acquaintance with some conventional programming language, PASCAL, assumed. Several people helped in various ways in the preparation process of the original German version of this book: Johannes KSbler, Eveline and Rainer Schuler, and Hermann Engesser from B.I. Wissenschaftsverlag. Regarding the English version, I want to express my deep gratitude to Prof. Ronald Book. Without him, this translated version of the book would not have been possible.

✦ Table of Contents


Cover
Series: Modern Birkhäuser Classics
Reprint title: Logic for Computer Scientists
Reprint copyright
Title: Logic for Computer Scientists
Copyright
Preface
Contents
Introduction
Chapter 1. PROPOSITIONAL LOGIC
1.1 Foundations
1.2 Equivalence and Normal Forms
1.3 Horn Formulas
1.4 The Compactness Theorem
1.5 Resolution
Chapter 2. PREDICATE LOGIC
2.1 Foundations
2.2 Normal Forms
2.3 Undecidability
2.4 Herbrand's Theory
2.5 Resolution
2.6 Refinements of Resolution
Chapter 3. LOGIC PROGRAMMING
3.1 Answer Generation
3.2 Horn Clause Programs
3.3 Evaluation Strategies
3.4 PROLOG
Bibliography
Table of Notations
Index


📜 SIMILAR VOLUMES


Classic Papers in Combinatorics (Modern
✍ Ira Gessel (editor), Gian-Carlo Rota (editor) 📂 Library 📅 2008 🏛 Birkhäuser 🌐 English

<p><span>This volume surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject proved in over five decades of original papers. </span></p>

The Versatile Soliton (Modern Birkhäuser
✍ Alexandre T. Filippov 📂 Library 📅 2010 🏛 Birkhäuser 🌐 English

<span>If you have not already heard about solitons, you will sooner or later encounter them. The soliton, a solitary wave impulse preserving its shape and strikingly similar to a particle, is one of the most fascinating and beautiful phenomena in the physics of nonlinear waves. In this engaging book

Linear Algebraic Groups (Modern Birkhäus
✍ T.A. Springer 📂 Library 📅 2008 🏛 Birkhäuser 🌐 English

<p><span>The first edition of this book presented the theory of linear algebraic groups over an algebraically closed field. The second edition, thoroughly revised and expanded, extends the theory over arbitrary fields, which are not necessarily algebraically closed. It thus represents a higher aim.

Riemann, Topology, and Physics (Modern B
✍ Michael I. Monastyrsky 📂 Library 📅 2008 🌐 English

<span>The significantly expanded second edition of this book combines a fascinating account of the life and work of Bernhard Riemann with a lucid discussion of current interaction between topology and physics. The author, a distinguished mathematical physicist, takes into account his own research at

Theory of Function Spaces (Modern Birkhä
✍ Hans Triebel 📂 Library 📅 2010 🏛 Birkhäuser 🌐 English

<span>The book deals with the two scales B</span><span><sup>s</sup></span><span><sub>p,q </sub></span><span>and F</span><span><sup>s</sup></span><span><sub>p,q</sub></span><span> of spaces of distributions, where ‑∞n in the framework of Fourier analysis, which is based on the technique of maximal fu