|
Courses with significant overlap with this course: Semester of last offering: Date of approval: dd-mmm-yyyy |
|||||
Prerequisites: Course Contents Formal theories, Consequence and deduction. Propositional Calculus: Syntax, Semantics, Applications; Axiomatic approach, Soundness, Consistency, Completeness. Other proof techniques: Sequent calculus, Tableaux. Boolean Algebras: Properties, Stone's theorem. Completeness of propositional calculus with respect to the class of Boolean algebras. Classical rst order theories: Syntax, Semantics; Axiomatic approach, Soundness; Sequent calculus, Tableaux. Equality, examples of rst order theories with equality. Consistency, Completeness (sketch), Elementary model theory, Decidability. Godel's incompleteness theorems: sketch.
Instructor(s):
Number of sections: Tutors for each section: Schedule for Lectures: Schedule for Tutorial: Schedule for Labs:
|