Symbolic Logic.

Catalog description

This sequel to PHIL 243 focuses on the form or structure of valid deductive arguments, and the simple and compound sentences that form them. It analyzes the rules of deductive inference, replacement rules, and how to translate ordinary English sentences into their symbolic equivalent. Proving the validity or invalidity of arguments in Sentential Logic, Predicate Logic, and Quantified Predicate Logic comprises a major portion of the course. Like math courses, this class has problems and proofs that students will work through in class and as homework. Prerequisite: PHIL 243 or permission of instructor.