Anita Wasilewska

A survey of the logical foundations of mathematics: development of propositional calculus and quantification theory, the notions of a proof and of a model, the completeness theorem, Gödel's incompleteness theorem. This course is offered as both CSE 371 and MAT 371.

Bulletin Link

• An understanding of classical propositional and predicate logic, including a full development of syntax, semantics, and proof techniques
• An understanding of semantic and syntactic concepts, e.g., truth versus proof, by exploring the soundness and completeness of calculi for these logics
• An ability to apply abstract reasoning skills through experience with formal proofs
• A working knowledge of non-classical logics and their use in Computer Science

• Anita Wasilewska, Logics for Computer Science: Classical and Non-Classical, Springer, 2018.

• Syntax and Semantics for Classical and various non-classical propositional logics.
• Two proofs of Completeness Theorem for classical propositional Logic.
• Automated Theorem proving systems for classical, intuitioinistic amd modal S4, S5 logics.
• Constructive Completeness Theorem proofs.
• First Order Classical Logic; syntax and semantics.
• Proof of Completeness Theorem.
• Formal Theories based on first order logic; Peano Arithmetic.
• Discussion of Godel Incompleteness and Inconsistency results.

Not applicable since it is a theory course.

CSE371