chapter 1 Sets, lattices, and Boolean algebras -- chapter 2 Introduction to propositional logic -- chapter 3 Normal forms of formulas -- chapter 4 The Craig lemma -- chapter 5 Complete sets of functors -- chapter 6 Compactness theorem -- chapter 7 Clausal logic and resolution -- chapter 8 Testing satisfiability, finding satisfying assignment -- chapter 9 Polynomial cases of SAT -- chapter 10 Embedding SAT into integer programming and into matrix algebra -- chapter 11 Coding runs of Turing machines, NP-completeness and related topics -- chapter 12 Computational knowledge representation with SAT – getting started -- chapter 13 Knowledge representation and constraint satisfaction -- chapter 14 Answer set programming, an extension of Horn logic -- chapter 15 Conclusions.