Good luck!

Proof by contradiction is a different proof strategy to proof by induction, but they’re often combined. Completeness is usually proved by contraposition, showing that unprovable arguments have counter-models.

That’s right, logic is at bottom about good reasoning, which is an essential part of philosophy. Logic in CS tends to focus on more practical aspects, like computability, decidability and computational complexity. Also there’s interesting theoretical links between proofs & programs, as in the Curry-Howard isomorphism.

That’s right - you can go from A->B to ~B->~A but not vice versa.

Thanks! The writing in the videos? That’s on Goodnotes on the ipad

@@AtticPhilosophy thanks! The background pic is really nice to read the writings :)

Are you interested in taking philosophy further? If so, ask your lecturers about PhD study. If not, think about what kind of work makes you most happy, and then look for careers that involve that kind of thing. If you're still at uni, talk to the careers service.

Thanks!