The Fall 2016 edition of the OLP remix *Sets, Logic, Computation* is ready. As before, it includes the OLP part on sets, relations, and functions; the part on first-order logic (with natural deduction chosen as the proof system); and the part on Turing computability including the unsolvability of the halting and decision problems. The methods chapter on induction and biographies of Cantor, Church, Gentzen, Gödel, Noether, Russell, Tarski, Turing, and Zermelo appear as appendices.

At students’ request, problems are now listed at the end of each chapter. Many typos and errors have been corrected, a number of examples and problems have been added, and several proofs rewritten for clarity. I’ve also added chapter summaries and a glossary. There are also a few added sections, notably introduction sections to Chapters 5 and 7, as well as discussion of Russell’s Paradox in both Chapter 1 and 6.

You can order a printed copy on Lulu, or download the PDF from the builds page. Read about what last term’s students thought of it here.

SLC F16