COT 3100 Exam 1 Study Guide

Chapter 2
1. Be able to recognize the difference between statements and non-statements.
2. Understand compound statements and the basic connectives negation, conjunction, disjunction, and the
conditional.
3. Be able to form statements from these connectives both symbolically and in sentence form.
4. Be able to work with mathematical statements such as those involving inequalities.
5. Understand statement forms and how to work them to solve problems possibly using truth tables.
6. Understand logical equivalence and how to demonstrate the logical equivalence of statement forms.
7. Know De Morgan’s Laws and possibly being able to prove them using a truth table or logical argument.
8. Be familiar with the concepts tautology and contradiction and be able to recognize and prove that
statements may be one or the other.
9. Familiarize yourself with the logical equivalences (laws) and be able to work with these to solve problems
and prove equivalence of statements.
10. Much of section 2 involves equivalent ways of expressing the conditional and its negation in both symbolic
and sentence form. Be able to understand and recognize these for the purpose of solving problems.
11. Familiarize yourself with the contrapositive, converse, and inverse of conditional statements and related
equivalences.
12. Understand the biconditional and how it represents logical equivalence.
13. Be familiar with the concept of an argument and argument form, their difference, and related terminology
such as a premise and conclusion of an argument or form.
14. Understand what makes an argument and argument form valid or invalid and be able to demonstrate
when a given argument or form is one or the other, either with a truth table, if practical, or as an
argument using the rules of inference.
15. Be able to recognize fallacious arguments, which may be due to invalidity or some other error in reason-
ing.

Chapter 3
1. Know what predicate statements are and the domain of predicate variables.
2. Be able to identify the truth set of a predicate.
3. Understand the concepts of quantified statements, both universal, existential and be able to work with
and translate into equivalent forms, both formal (symbolic) and informal (language).
4. Recognize and be able to work with universal conditional statements both formally and informally.
5. Be able to form negations of quantified statements both formally and informally.
6. Be able to work with quantified statements involving multiple quantifiers both formally and informally,
including negating such statements.
7. Understand the analogous universal argument form for modus ponens, modus tollens, and transitivity.
8. Be able to use mathematical induction to verify a universal statement involving integers.