A propositional proof system is a system used to prove classical propositional tautologies. It was developed by Stephen Cook and Robert Reckhow in the 1970s. It is used in propositional calculus and proof complexity.

CSE 311 introduces theoretical computer science, the theory background necessary for other CSE courses, and how to construct rigorous, formal arguments. Topics include logic, set theory, modular arithmetic, induction, regular expression, and relations.