Current literature like journal articles, articles from the Handbook of Satisfiability, etc. will be discussed during the lecture.

1) Propositional and predicate logic

a) Syntax, normal forms and normal form translations

b) Semantics, evaluation of a given formula with respect to a given interpretation, the concept of logical consequence (entailment) also under theories, Translation of validity, entailment, equivalence and satisfiablity problems into each other, proof procedures (beeing able to apply tableau, sequent systems or NK)

2) Ability to construct simple proofs

a) Induction proofs (for simple examples

b) Simple proofs of run-time or space estimations (Example: Show that the time complexity of breadth first search with a fixed branching degree b and depth d is in O(b^d). I expect a formally correct proof including explanations (e.g., for the O-notation).

The previous knowledeg had been taught in the course "Theoretischer Informatik und

Logik" (TIL), "formalen Methoden der Informatik" (FMINF), "Algorithmen und Datenstrukturen" and

math lectures from the beginning of our bachelor studies. For a part of the knowledge about logic,

the slides of TIL and from the block Satisfiability (SAT) of FMINF (http://www.logic.at/lvas/fminf/) could be helpfull.