Q&A section for all courses. Add courses and comments anonymously.

University of Waterloo

Waterloo, Ontario

2 votes

SE 212

Logic and Computation

Propositional and predicate logic. Soundness and completeness and their implications. Unprovability of formulae in certain systems. Undecidability of problems in computation, including the halting problem. Reasoning about programs. Correctness proofs for both recursive and iterative program constructions.

TOMAN is the worst

Added by Anonymous on 2011-10-18 22:11:54

Log in with Facebook to add a comment

Log in with Facebook to participate in the Q&A.