The book familiarizes the reader with the essential subfields of formal logic that are part of the curriculum in theoretical computer science. The presentation is tailored to the needs of computer science students. In particular, many results of formal logic that are more focused on principles are addressed from an algorithmic perspective. This approach significantly facilitates access to the abstract subject area. Prof. Schöning achieves a compact and comprehensible presentation of propositional and predicate logic, where the necessary terms are introduced precisely and illustrated with examples. Based on this, applications of logic in computer science, such as resolution, automated theorem proving, and logic programming, are discussed. Numerous exercises with detailed solutions help deepen understanding.