Logic for Computer Science

With 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. In a course on logic for computer, the search for efficient algorithms which decide satisfiability (or validity) of formulas should be investigated. In such a course on logic for computer science, one may teach the following topics:

• Foundations of propositional logic

• Equivalence and normal forms

• Horn formulas

• The compactness theorem

• Resolutions

• Foundations of predicate logic

• Normal forms

• Undecidability

• Herbrand's Theory

• Resolution

• Refinements of resolutions

• Horn Clause Programs

• Evaluations Strategies

• PROLOG

For more details, refer to the following book:

Schöning, U. (2008). Logic for computer scientists. Springer Science & Business Media.