Below is a list of student learning objectives for each week. In each exam, you will be tested only on these objectives, so **this page serves as a study guide for the exams**. This page will be updated periodically to reflect our progress in the course. In order to keep up with the course, by the end of each week, you should be able to do the tasks listed.

If you have any question, don’t hesitate to email me at ishiday@ohio.edu (or through the email tool on Blackboard).

By the end of each week below, you should be able to what is listed. The lectures and the questions given in the lectures are designed to help you achieve these objectives. So be sure to review the lectures and do the questions to test your mastery.

#### Week 1

- Define inference, reasoning, argument, premises, and conclusion.
- Give examples of reasoning and unconscious inference.
- Present reasoning in the standard form of an argument as discussed in the lecture.

#### Week 2

- Give an example of reasoning in decision making.
- Define the framing effect, and give an example.
- Reconstruct possible answers to the disease problem in the standard form of an argument. (See Question 1 at the end of this week’s lecture.)
- Reconstruct examples of reasoning in the Kid Logic episode in the standard form of an argument. (See Questions 8 and 9.)
- Define a cognitive bias, and explain why the framing effect in the disease problem counts as a cognitive bias.
- Define validity and invalidity. Give examples of valid and invalid arguments.
- Use the method of counterexamples to show that a given argument is invalid. (See Question 13.)
- Define the belief bias.

#### Week 3

- Use the method of counterexamples to show the invalidity of arguments. (See examples given in the lecture.)
- Describe Type 1 and Type 2 processes according to the dual process theory (as formulated by Evans and Stanovich).
- Briefly explain the idea of cognitive decoupling as it is used in the description of Type 2 processes. (One well-chosen sentence would suffice.)

**Exam 1 covers Weeks 1–3.**

#### Week 4

- Explain the distinguishing features of deductive reasoning.
- Explain the distinguishing features of inductive reasoning.
- Explain the meaning of the term “follow from” (as in “this conclusion follows from the premises”).
- Explain the meaning of the term “entailment.”
- Define soundness.
- Define inductive strength.
- Define reliability.

#### Week 5

- State the three things that make up a formal system.
- Prove the MEOW-validity of arguments, using
**MEOW**. (You don’t have to memorize the rules of inference of**MEOW**. But you will have to memorize everything about**SL**below.) - Distinguish simple and complex strings of
**SL**. - Distinguish strings and non-strings of
**SL**. - Symbolize elementary English sentences into
**SL**.

#### Week 6

- Symbolize arguments stated in English into the language of
**SL**. - Use parentheses in symbolization to accurately represent the meaning of English sentences.
- State the rules of inference MP, MT, and DN.
- Prove the validity of arguments by constructing formal proofs in
**SL**. (The available rules of inference so far are MP, MT, and DN.)

**Exam 2 covers Weeks 4–6.**

#### Week 7

- Define the concept of a formal fallacy.
- Describe affirming the consequent and denying the antecedent.
- State the rules of inference Simp, Conj, and
~~CS~~.**[We’ll skip CS.]** - Prove the validity of arguments by constructing formal proofs in
**SL**. (The available rules so far are MP, MT, DN, Simp, Conj, and~~CS.~~)

#### Week 8

- State the rule of inference DS.
~~Symbolize the exclusive “or” in~~.**SL**- Define a contradiction in
**SL**, and identify strings that are contradictions. - Prove the validity of arguments by constructing formal proofs in
**SL**. (The available rules so far are MP, MT, DN, Simp, Conj,~~CS~~, and DS.)

#### Week 9

- State the rule of inference RA.
- Prove the validity of arguments by using RA in formal proofs in
**SL**. - Prove the validity of arguments by constructing formal proofs in
**SL**. (The available rules so far are MP, MT, DN, Simp, Conj,, DS, and RA.)~~CS~~

**Exam 3 covers Weeks 7–9.**

#### Week 10

- State the conventions of
*Normality*and*Certainty*. - Symbolize probabilities of simple and complex sentences.
- Determine probabilities using the conventions.

#### Week 11

- State the rules for the probabilities of conjunctions, disjunctions, and negations.
- Symbolize and determine the probabilities, using the rules you learned so far.

#### Week 12

- Give the correct answer to the Linda problem, using the rules of probability theory.
- State the conjunction fallacy.
- Define a heuristic in the sense of Tversky and Kahneman.
- State the representativeness heuristic.

**Exam 4 covers Weeks 10–12.**

**Week 13**

- Define a base rate.
- State the base rate neglect.
- Symbolize conditional probabilities.
- State the definition of conditional probability.
- Determine conditional probabilities, using the definition of conditional probability.
- Solve the taxicab and mammography problems, and other similar problems (see Q3–5), using the method of natural frequencies.

#### Week 14

- Evaluate the strength of inductive arguments like those in the mammography problem.
- Define an attributional inference.
- Define the fundamental attribution error.

**Final Exam covers Weeks 1–14.**