Wednesday 11.15 WP108: all non-CS students (William Perkin Building)
Friday 11.15 SR112: all CS students (Scott-Russell Building)
Friday 14.15 CMS21 (not SR112) my office for any individual questions (Colin Maclaurin Building)
A. Doxiadis, C. H. Papadimitriou, Logicomix, Bloomsbury, 2009. This is a graphic novel about the early development of logic.
D. Harel, Computers Ltd What they really can't do, OUP, 2012.
D. R. Hofstadter, G"odel, Escher, Bach: an eternal golden braid, Basic Books, 1999. Beyond simple description: mind blowing.
R. Hammack, Book of proof, VCU Mathematics Textbook Series, 2009. This book can be downloaded for free here.
S. Lipschutz, M. Lipson, Discrete mathematics, second edition, McGraw-Hill, 1997. This is useful for further practice in the mathematical ideas introduced in this course.
P. Teller, A modern formal logic primer, Prentice Hall, 1989. This is now freely available. Just click the title.
M. Zegarelli, Logic for dummies, Wiley Publishing, 2007
For propositional logic the first 14 chapters of this book cover pretty much what I cover in Section 4.
Chapters 20 to 25 are useful background reading. The material in Chapters 9 to 12, I shall handle using only truth trees.
Chapters 15 to 19 deal with first-order logic.
| 1 |
2 |
3 |
4 |
5 |
6 |
7 |
| Introduction |
Functions and counting Lecture2 Lecture 3 Lecture 4 Lecture 5 Lecture 6 |
Euclid Proofs Lecture 7 (Euclid above and part of proofs) Lecture 8 Lecture 9: see printed notes (reciprocal subtraction primes for fun) Lecture 10: test 1 |
Propositional Logic Section 4.1 to Section 4.3 Lectures 11, 12, 13 Section 4.4 Lecture 14 Lecture 15 Section 4.5 Section 4.6 Lecture 16 Lecture 17 Lecture 18 |
Boolean algebras Lecture 20 Lecture 21 Test 2 Lecture 22 |
P = NP? sudoku Lecture 23 |
Relations and first order logic 7.1 to 7.3 7.4 to 7.6 Truth trees Lecture 24 Lecture 25 Lecture 26 Lecture 27 Lecture 28 |
| Truth
table generator Truth tree solver Merci a Gabriel Labrecque The notation used is slightly different from mine but the translations are obvious Lecture 19 Quiz 1 |
||||||
| Bits
and codes Lecture1pptx |
SetTheoryppt Functionsppt Russell's Paradox |
P = NP? |
| Chapter 1 |
Chapter 2 |
Chapter 3 |
Chapter 4 |
Chapter 5 |
Chapter 7 |
