LOGIC. Name: Teacher: Pd: Page 1

Size: px
Start display at page:

Download "LOGIC. Name: Teacher: Pd: Page 1"

Transcription

1 LOGIC Name: Teacher: Pd: Page 1

2 Table of Contents Day 1 Introduction to Logic HW pages 8-10 Day 2 - Conjunction, Disjunction, Conditionals, and Biconditionals HW pages #13-34 all, #35 65(every other odd) Day 3 Truth Tables, Tautologies and Logically Equivalent Statements HW pages # s 1, 5, 8, 12, 18, 23 Day 4 Law of Detachment HW pages # s 1-4,15, all Day 5 Law of Contrapositive, Inverse, Converse; Proofs in Logic HW pages # s 9, 11, 15, 29, 32 Day 6 Law of Modus Tollens; Invalid arguments HW pages #s 2, 6, 10, even, 21 Pages #s 2-28, even Day 7 The Chain Rule; Law of Disjunctive Inference HW pages # s 2, 8, 13, 14, 20, 35 pages # s 2, 9, 12, 13, 22, 27, 28 Day 8 De Morgan s Law and Law of Simplification HW - pages # s 1 29 every other odd pages # s 1-7 odd, odd, odd Day 9 Practice with Logic Proofs HW pages Day 10 Review Exercises HW pages SUMMARY PAGE Page 69 Exam Page 2

3 Introduction to Logic Logic is the study of reasoning. All reasoning, mathematical or verbal, is based on how we put sentences together. A mathematical sentence is a sentence that states a fact or contains a complete idea. A sentence that can be judged true or false is called a statement. In the study of logic, each statement is designated by a letter (p, q, r, etc.) and is assigned a true value (T for true or F for false.) Two types of mathematical sentences are a) open sentence contains a variable and cannot assign a truth value. Ex. She is at the park. Ex. It is fun. b) closed sentence (statement) a sentence that can be judged to be either true or false. Ex. The degree measure of a right angle is Ex. There are eight days in a week. Example/Practice 1: Page 3

4 Negation Symbol: The negation of a statement always has the opposite truth value of the original statement. It is usually formed by adding the word not to the original statement. Ex. p : There are 31 days in January. (True) ~p : There are not 31 days in January. (False) A statement and its negation have opposite truth values. Example/Practice 2: Write the negations for each of the following true sentences. 1. Today s weather is sunny. 2. Alice is not going to the play. 3. x 2 Example 3: Answers: a. b. a. b. Page 4

5 EXAMPLE 4: Let p represent: January has 31 days Let q represent: Christmas is in December For each given sentence: a. Write the sentence in symbolic form using the symbols below. b. Tell whether the sentence is true or false. 1. It is not the case that January has 31 days a. b. 2. It is not true that Christmas is not in December a. b. 3. January has 31 days. a. b. Truth Table To study sentences where we wish to consider all truth values that could be assigned, we use a device called a truth table. A truth table is a compact way of listing symbols to show all possible truth values for a set of sentences. Example 5: Fill in all missing symbols. Translating Statements from Words to Symbols Page 5

6 Example 6: Let p represents The bird has wings Let q represents The bird can fly Write each of the following sentences in symbolic form. 1. The bird has wings and the bird cannot fly. 2. If the bird can fly, then the bird has wings. 3. The bird cannot fly or the bird has wings. 4. The bird can fly if and only if the bird has wings. Challenge Problem Summary/Closure Page 6

7 Exit Ticket Page 7

8 DAY 1 Homework) Page 8

9 Translating Statements From Words To Symbols Page 9

10 Page 10

11 Conjunctions and Disjunctions SWBAT: UWarm - Up In logic, a is a compound sentence formed by combining two sentences (or facts) using the word p: Wash the dishes. q: Vacuum the house. p ^ q: For a conjunction (and) to be true, facts must be true. p q p ^ q Page 11

12 In logic, a is a compound sentence formed by combining two sentences (or facts) using the word p: Wash the dishes. q: Vacuum the house. p v q: For a disjunction (or) to be true, facts must be true. p q p V q Page 12

13 UConditional U: if then In logic, a is a compound statement formed by combining 2 sentences (or facts) using the words Refer to the statement: If I come to school then Ms. Williams will give me an A. Let p: I come to school. Let q: Ms. Williams gives me an A. Based on this condition, fill in the accompanying chart. p q p q T T T F F T F F A is a compound sentence formed by combining the two conditionals: p q and q p. Page 13

14 Summary of Compound Sentences A conjunction is a compound sentence formed by using the word and to combine two simple sentences. p q p q T T T F F T F F A disjunction is a compound sentence formed by using the word or to combine two simple sentences. p q p q T T T F F T F F A conditional is a compound sentence usually formed by using the words if then to combine two simple sentences. p q p q T T T F F T F F A biconditional is a compound sentence formed by combining the two conditionals p q and q p. p q p q T T T F F T F F Page 14

15 Challenge Problem: Directions: Complete the truth table p q p q p V q Exit Ticket: Page 15

16 HW Day 2 Assignment Page 16

17 Page 17

18 Truth Tables, Tautologies, and Logically Equivalent Statements SWBAT: UWarm - Up In logic, a tautology is a compound statement that is always true, no matter what truth values are assigned to the simple sentences within the compound sentence. Example: p q (p q) Example: (p q) (p q) Page 18

19 Logically Equivalent Statements When two statements have the same truth values, we say that the statements are logically equivalent. To show that equivalence exists between two statements, we use the biconditional, if and only if: If the result is a tautology then the statements are logically equivalent. Ex.1 Let p represent I study. Let q represent I ll pass the test. The two statements being tested for an equivalence are: If I study, then I ll pass the test. I don t study or I ll pass the test. a) Express each statement in symbolic form. b) Express the biconditional in symbolic form. c) Set up a truth table to see if the statements are logically equivalent. Ex. 2 Let c represent Simon takes chorus. Let s represent Simon takes Spanish. a) Using s and c and proper logic connectives, express each of the following sentences in symbolic form. If Simon takes chorus, then he cannot take Spanish. If Simon takes Spanish then he cannot take chorus. b) Prove that the two statements are logically equivalent, or give a reason why they are not equivalent. Page 19

20 SUMMARY Page 20

21 HW Day 3 Tautologies and Logically Equivalent Statements Page 21

22 Page 22

23 Law of Detachment SWBAT: UWarm - Up UDeductive reasoningu is the process of using logic to draw conclusions from given facts, definitions, and properties. In deductive reasoning, if the given facts are true and you apply the correct logic, then the conclusion must be true. The Law of Detachment is one valid form of deductive reasoning. An argument consists of a series of statements called premises and a final statement called a conclusion. We say that the premises lead to the conclusion, or that the conclusion follows the premises. For example: Premise: UPremise: Conclusion: If I play baseball, then I need a bat. I play baseball. I need a bat. Page 23

24 Example 1: An auto mechanic knows that if a car has a dead battery, the car will not start. A mechanic begins work on a car and finds the battery is dead. What conclusion will she make? Example 2: If there is lightning, then it is not safe to be out in the open. Marla sees lightning from the soccer field. What conclusion will she make? Example 3: If it is snowing, then the temperature is less than or equal to 32 F. The temperature is 20 F. What conclusion can you make? UModel Problems Example 4: Let r represent It is raining. Let m represent I have to mow the lawn. Given the following premises: If it is raining, then I don t have to mow the lawn. It is raining. a. Using r, m, and proper logic connectives, express the premises of this argument in symbolic form. b. Write a conclusion in symbolic form. c. Translate the conclusion into words. Page 24

25 Hidden Conditionals Sometimes a conditional does not always use the words if. then or the word implies. Such a statement is called a hidden conditional. Ex. A polygon of three sides is called a triangle. If a polygon has three sides, then the polygon is called a triangle. Ex. What s good for Bill is good for me. If it s good for Bill then it s good for me. Ex. I ll get a job when I graduate. If I graduate, then I ll get a job. Ex. Drink milk to stay healthy. If you drink milk, then you will stay healthy. Example 5: Write a valid conclusion for the given premises or indicate that no conclusion is possible. Premises: If adjacent angles are supplementary, then the angles form a linear pair. Example 6: Write a valid conclusion for the given premises or indicate that no conclusion is possible. Premises: Reading will give a person knowledge. Mrs. Williams is an avid reader. Page 25

26 SUMMARY Exit Ticket Page 26

27 Day 4 Law of Detachment HW Page 27

28 Page 28

29 Page 29

30 Inverse, Converse, Contrapositive SWBAT: UWarm - Up The converse is formed by interchanging the hypothesis and the conclusion. The inverse is formed by negating the hypothesis and negating the conclusion. The contrapositive is formed by negating both the hypothesis and conclusion, and then interchanging the resulting negations. Ex. Given the conditional : p q Find the converse: Find the inverse: Find the contrapositive: Ex. s: It is spring m: The month is May Conditional (s m): If it is spring, then the month is May. Inverse ( ): Converse ( ): Contrapositive ( ): The inverse and converse of a given conditional do not always have the same truth value as the given conditional. The conditional and its contrapositive are logically equivalent statements. The inverse and converse of a given conditional are logically equivalent to each other. Complete the truth tables. Page 30

31 Find the inverse, converse and contrapositive of each of the given statements: 1. t ~w 2. ~m p 3. If you use Tickle deodorant, then you will not have body odor. 4. If a man is honest, then he does not steal. UPractice 1. Given the true statement: If a person is eligible to vote, then that person is a citizen. Which statement must also be true? (1) Kayla is not a citizen; therefore, she is not eligible to vote. (2) Juan is a citizen; therefore, he is eligible to vote. (3) Marie is not eligible to vote; therefore, she is not a citizen. (4) Morgan has never voted; therefore, he is not a citizen. 2. What is the inverse of the statement If Julie works hard, then she succeeds? (1) If Julie succeeds, then she works hard. (2) If Julie does not succeed, then she does not work hard. (3) If Julie works hard, then she does not succeed. (4) If Julie does not work hard, then she does not succeed What is the converse of the statement "If a b c, then ABC is a right triangle"? (1) If ABC is a right triangle, then a b c (2) a b c if, and only if, ABC is a right triangle (3) If ABC is not a right triangle, then a b c (4) If a b c, then ABC is not a right triangle. Page 31

32 U p UII. Law of ContrapositiveU: States that when a conditional premise is true, then the contrapositive of the premise if true. OR A conditional and its contrapositive are logically equivalent. q U or (p q) (~q ~p) ~q ~p Proofs in Logic When we are given a series of premises that are true and we apply laws of reasoning to reach a conclusion that is true, we say that we are proving an argument by means of a formal proof. We use two columns. The first column consists of statements and the second column consists of reasons. Given the premises: If Joanna saves enough money, then she can buy a bike. Joanna cannot buy a bike. Prove the conclusion: Joanna did not save enough money. Statements Reasons Your Turn! 4. Given the premises: If Al does not study, then he will fail. Al did not fail. Prove the conclusion: Al studied. **** Make sure you set up a formal proof! **** Page 32

33 Proofs in Logic Page 33

34 Exit Ticket Page 34

35 Day 5 - HW Inverse, Converse, and Contrapositive Page 35

36 Page 36

37 Page 37

38 Law of Modus Tollens and Invalid Arguments SWBAT: UWarm - Up In Ruritania, when Juliet is no longer the queen, then her son Prince Charles will take the throne as the new king. Let us use these facts to present a third law of reasoning. Let p represent Charles is the prince and let q represent Juliet is the queen Premise (p q): UPremise ( q): Conclusion ( p): If Charles is still the prince, then Juliet is still the queen. Juliet is no longer the queen. Charles is no longer the prince. What two laws does the Law of Modus Tollens combine? Page 38

39 Ex. 1. Write a valid conclusion for the given set of premises: If I am smart, then I like chemistry. I do not like chemistry. Ex. 2. Write a valid conclusion: ~r ~q Uq Ex. 3. Write a formal proof: Ex 4: Write a formal proof Given: The scale is broken if Sal weighs less than 150 pounds. The scale is not broken. Prove: Sal does not weigh less than 150 pounds. Let b represent: The scale is broken Let w represent: Sal weighs less than 150 pounds. Page 39

40 Invalid Arguments At times, we may be confronted with an argument in which all of its premises are true but these premises do not always lead to a conclusion that is true. The conclusion could be true or false. Such an argument is called an Uinvalid argument. Example 1: The First Invalid Argument Prove why this is invalid. Example 2: Prove why this is invalid. Page 40

41 Model Problems In 1-4, if the argument is valid, state the law of reasoning that tells why the conclusion is true. If the argument is invalid, write UInvalid. Page 41

42 SUMMARY U SUMMARY EXIT TICKET Page 42

43 Day 6 Law of Modus Tollens/Invalid Arguments HW Page 43

44 Invalid Arguments Page 44

45 Page 45

46 The Chain Rule and The Law of Disjunctive Inference SWBAT: UWarm - Up Ex 3: If Phil is not on time, then he will be fired. If Phil is fired, then Trude will get his job. Page 46

47 Ex 4: Given: a c ~a b ~c Prove: b Ex 5: Given: If I walk, then I don t run I do not collapse if I don t run I collapse If I do not walk, then I am out of breath. Prove: I am out of breath Page 47

48 V. Law of Disjunctive Inference: In the first four laws of inference presented, one or more of the premises was in the form of a conditional statement p q. In this next inference law, there are no conditional statements in the given premises. As we watch a mystery show on television, we believe that the criminal is either the butler or the strange neighbor. We then discover a clue that rules out the neighbor. We can now infer that the butler did it! Let b represent The butler is the criminal, and let n represent The neighbor is the criminal. In words and in symbols we say: Premise (b n): UPremise ( n): Conclusion (b): The butler is the criminal or the neighbor is the criminal. The neighbor is not the criminal. The butler is the criminal. Page 48

49 Ex. 2. Write a formal proof: Given: c b a ~b c Prove: a SUMMARY Exit Ticket Page 49

50 Chain Rule HW Day 7: Chain Rule and Law of Disjunctive Inference Page 50

51 Page 51

52 Page 52

53 Law of Disjunctive Inference Page 53

54 Page 54

55 Negations, De Morgan s Laws, and Law of Simplification SWBAT: UWarm - Up VI. Law of Double Negation ~(~p) and p are logically equivalent statements. VI. DeMorgan s Law The next two laws of inference were discovered by an English mathematician named De Morgan and they bear his name. These inference rules tell how to negate a conjunction and how to negate a disjunction. 1. Negation of a Conjunction The negation of a conjunction of two statements is logically equivalent to the disjunction of the negation of each. 2. Negation of a Disjunction The negation of a disjunction of two statements is logically equivalent to the conjunction of the negation of each. Ex. Write the statement that is logically equivalent to the given statement: a) ~(h ~d) b) It is not true that I will take Gloria to the dance or I will take Patricia to the dance. c) What is the negation of ~ t m? Page 55

56 Ex 2: Write a statement that is logically equivalent to: It is not true that I will take Gloria to the dance or I will take Patricia to the dance. Ex 3: Page 56

57 VIII. The Law of Simplification: states that when a single conjunctive premise is true, it follows that each of the individual conjuncts must be true. p q p p q q IX. The Law of Conjunction: states that when two given premises are true, it follows that the conjunction of these premises is true. p q p q X. The Law of Disjunctive Addition: states that when a single premise is true, it follows that any disjunction that has this premise as one of its disjuncts must also be true. p p q Ex 4: Given: r t r m t k Ex 5: Prove: k Page 57

58 SUMMARY Exit Ticket If the statements c d and p d are true, which statement must also be true? Page 58

59 De Morgan s Law HW Day 8: De Morgan s Law, and Law of Simplification Page 59

60 Page 60

61 Law of Simplification Page 61

62 Page 62

63 Practice with Logic Proofs Page 63

64 Page 64

65 Page 65

66 Review Exercises Page 66

67 Page 67

68 Page 68

69 SUMMARY PAGE Page 69

70 HOMEWORK ANSWERS Page 70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd:

GEOMETRY. Chapter 2: LOGIC. Name: Teacher: Pd: GEOMERY Chapter 2: LOGIC Name: eacher: Pd: able of Contents DAY 1: SWBA: Identify, write and analyze the different types of logical statements. Pgs: 2-8 Homework: Pgs 6 8 (EVEN ONLY) DAY 2: SWBA: Write

More information

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 1: The Logic of Compound Statements. January 7, 2008 Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive

More information

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS 1.1 - Logical Form and Logical Equivalence Definition. A statement or proposition is a sentence that is either true or false, but not both. ex. 1 + 2 = 3 IS a statement

More information

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook) Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or

More information

Compound Propositions

Compound Propositions Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth

More information

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside. You are a mathematician if 1.1 Overview you say to a car dealer, I ll take the red car or the blue one, but then you feel the need to add, but not both. --- 1. Logic and Mathematical Notation (not in the

More information

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both. Chapter 3: Logic Diana Pell Section 3.1: Statements and Quantifiers A statement is a declarative sentence that is either true or false, but not both. Exercise 1. Decide which of the following are statements

More information

The statement calculus and logic

The statement calculus and logic Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages

More information

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the

More information

Where are my glasses?

Where are my glasses? Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the

More information

Propositions. Frequently, we will use the word statement instead of proposition.

Propositions. Frequently, we will use the word statement instead of proposition. Propositional Logic Propositions A proposition is a declaration of fact that is either true or false, but not both. Examples and non-examples: One plus two equals four (proposition) Mozart is the greatest

More information

DISCRETE MATHEMATICS BA202

DISCRETE MATHEMATICS BA202 TOPIC 1 BASIC LOGIC This topic deals with propositional logic, logical connectives and truth tables and validity. Predicate logic, universal and existential quantification are discussed 1.1 PROPOSITION

More information

CSC Discrete Math I, Spring Propositional Logic

CSC Discrete Math I, Spring Propositional Logic CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)

More information

AMTH140 Lecture 8. Symbolic Logic

AMTH140 Lecture 8. Symbolic Logic AMTH140 Lecture 8 Slide 1 Symbolic Logic March 10, 2006 Reading: Lecture Notes 6.2, 6.3; Epp 1.1, 1.2 Logical Connectives Let p and q denote propositions, then: 1. p q is conjunction of p and q, meaning

More information

The Logic of Compound Statements cont.

The Logic of Compound Statements cont. The Logic of Compound Statements cont. CSE 215, Computer Science 1, Fall 2011 Stony Brook University http://www.cs.stonybrook.edu/~cse215 Refresh from last time: Logical Equivalences Commutativity of :

More information

1.1 Statements and Compound Statements

1.1 Statements and Compound Statements Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something

More information

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1) CS100: DISCREE SRUCURES Lecture 5: Logic (Ch1) Lecture Overview 2 Statement Logical Connectives Conjunction Disjunction Propositions Conditional Bio-conditional Converse Inverse Contrapositive Laws of

More information

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference)

Today s Lecture 2/25/10. Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Today s Lecture 2/25/10 Truth Tables Continued Introduction to Proofs (the implicational rules of inference) Announcements Homework: -- Ex 7.3 pg. 320 Part B (2-20 Even). --Read chapter 8.1 pgs. 345-361.

More information

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov

Introduction Logic Inference. Discrete Mathematics Andrei Bulatov Introduction Logic Inference Discrete Mathematics Andrei Bulatov Discrete Mathematics - Logic Inference 6-2 Previous Lecture Laws of logic Expressions for implication, biconditional, exclusive or Valid

More information

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class)

MACM 101 Discrete Mathematics I. Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) MACM 101 Discrete Mathematics I Exercises on Propositional Logic. Due: Tuesday, September 29th (at the beginning of the class) SOLUTIONS 1. Construct a truth table for the following compound proposition:

More information

Chapter 1 Logic Unit Math 114

Chapter 1 Logic Unit Math 114 Chapter 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Statements Definition: A statement is a group of words or symbols that can be classified as true or false. Examples of statements

More information

Math 3336: Discrete Mathematics Practice Problems for Exam I

Math 3336: Discrete Mathematics Practice Problems for Exam I Math 3336: Discrete Mathematics Practice Problems for Exam I The upcoming exam on Tuesday, February 26, will cover the material in Chapter 1 and Chapter 2*. You will be provided with a sheet containing

More information

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013

Propositional Logic. Argument Forms. Ioan Despi. University of New England. July 19, 2013 Propositional Logic Argument Forms Ioan Despi despi@turing.une.edu.au University of New England July 19, 2013 Outline Ioan Despi Discrete Mathematics 2 of 1 Order of Precedence Ioan Despi Discrete Mathematics

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment

More information

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares

More information

(b) Follow-up visits: December, May, October, March. (c ) 10, 4, -2, -8,..

(b) Follow-up visits: December, May, October, March. (c ) 10, 4, -2, -8,.. Geometry Honors - Chapter 2 Reasoning and Proof Section 2-1 Inductive Reasoning and Conjecture I can explore inductive and deductive reasoning. I can find counterexamples to disprove conjectures. I can

More information

PROPOSITIONAL CALCULUS

PROPOSITIONAL CALCULUS PROPOSITIONAL CALCULUS A proposition is a complete declarative sentence that is either TRUE (truth value T or 1) or FALSE (truth value F or 0), but not both. These are not propositions! Connectives and

More information

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.

Symbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables

More information

Logic and Propositional Calculus

Logic and Propositional Calculus CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know

More information

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04

An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 An Introduction to Logic 1.1 ~ 1.4 6/21/04 ~ 6/23/04 1 A Taste of Logic Logic puzzles (1) Knights and Knaves Knights: always tell the truth Knaves: always lie You encounter two people A and B. A says:

More information

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP)

Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning. Mathematical Proof and Proving (MPP) Steinhardt School of Culture, Education, and Human Development Department of Teaching and Learning Terminology, Notations, Definitions, & Principles: Mathematical Proof and Proving (MPP) 1. A statement

More information

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before

More information

ANS: If you are in Kwangju then you are in South Korea but not in Seoul.

ANS: If you are in Kwangju then you are in South Korea but not in Seoul. Math 15 - Spring 2017 - Homework 1.1 and 1.2 Solutions 1. (1.1#1) Let the following statements be given. p = There is water in the cylinders. q = The head gasket is blown. r = The car will start. (a) Translate

More information

Conditional Statements

Conditional Statements 2.1 TEXAS ESSENTIAL KNOWLEDGE AND SKILLS G.4.B Conditional Statements Essential Question When is a conditional statement true or false? A conditional statement, symbolized by p q, can be written as an

More information

Unit 1 Logic Unit Math 114

Unit 1 Logic Unit Math 114 Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific

More information

software design & management Gachon University Chulyun Kim

software design & management Gachon University Chulyun Kim Gachon University Chulyun Kim 2 Outline Propositional Logic Propositional Equivalences Predicates and Quantifiers Nested Quantifiers Rules of Inference Introduction to Proofs 3 1.1 Propositional Logic

More information

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference

10/5/2012. Logic? What is logic? Propositional Logic. Propositional Logic (Rosen, Chapter ) Logic is a truth-preserving system of inference Logic? Propositional Logic (Rosen, Chapter 1.1 1.3) TOPICS Propositional Logic Truth Tables Implication Logical Proofs 10/1/12 CS160 Fall Semester 2012 2 What is logic? Logic is a truth-preserving system

More information

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.

5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction. Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent

More information

1.5 MATHEMATICAL LANGUAGE

1.5 MATHEMATICAL LANGUAGE 1.5 MATHEMATICAL LANGUAGE Contemporary Calculus The calculus concepts we will explore in this book are simple and powerful, but sometimes subtle. To succeed in calculus you will have to master some techniques,

More information

Chapter 2. Reasoning and Proof

Chapter 2. Reasoning and Proof Chapter 2 Reasoning and Proof 2.1 Inductive Reasoning 2.2 Analyze Conditional Statements 2.3 Apply Deductive Reasoning 2.4 Use Postulates and Diagrams 2.5 Algebraic Proofs 2.6 Segments and Angles Proofs

More information

Discrete Structures for Computer Science

Discrete Structures for Computer Science Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #2: Propositional Logic Based on materials developed by Dr. Adam Lee Today s Topic: Propositional

More information

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning

Valid Reasoning. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing February, Outline Truth and Validity Valid Reasoning Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February, 2018 Alice E. Fischer Reasoning... 1/23 1 Truth is not the same as Validity 2 Alice E. Fischer Reasoning... 2/23 Truth is not the

More information

Intermediate Logic. Natural Deduction for TFL

Intermediate Logic. Natural Deduction for TFL Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The

More information

Propositional Logic. Spring Propositional Logic Spring / 32

Propositional Logic. Spring Propositional Logic Spring / 32 Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements

More information

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic

Discrete Mathematical Structures. Chapter 1 The Foundation: Logic Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction

More information

Section 1.2: Propositional Logic

Section 1.2: Propositional Logic Section 1.2: Propositional Logic January 17, 2017 Abstract Now we re going to use the tools of formal logic to reach logical conclusions ( prove theorems ) based on wffs formed by some given statements.

More information

COT 2104 Homework Assignment 1 (Answers)

COT 2104 Homework Assignment 1 (Answers) 1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)

More information

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations

3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element

More information

LOGIC. 11 Converse, Inverse, Contrapositve. 12/13 Quiz Biconditional Statements

LOGIC. 11 Converse, Inverse, Contrapositve. 12/13 Quiz Biconditional Statements Name Period GP LOGIC I can define, identify and illustrate the following terms Conditional Statement Hypothesis Conclusion Inductive Reasoning Deductive Reasoning Inverse Converse Contrapositive Biconditional

More information

1.1 Language and Logic

1.1 Language and Logic c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,

More information

Unit 1 Logic Unit Math 114

Unit 1 Logic Unit Math 114 Unit 1 Logic Unit Math 114 Section 1.1 Deductive and Induction Reasoning Deductive Reasoning: The application of a general statement to a specific instance. Deductive reasoning goes from general to specific

More information

Math 2534 Solution Homework 2 Spring 2017

Math 2534 Solution Homework 2 Spring 2017 Math 2534 Solution Homework 2 Spring 2017 Put all work on another sheet of paper unless told otherwise. Staple multiple sheets. Problem 1: Use Algebra of Logic to prove the following and justify each step.

More information

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob

More information

Section 2-1. Chapter 2. Make Conjectures. Example 1. Reasoning and Proof. Inductive Reasoning and Conjecture

Section 2-1. Chapter 2. Make Conjectures. Example 1. Reasoning and Proof. Inductive Reasoning and Conjecture Chapter 2 Reasoning and Proof Section 2-1 Inductive Reasoning and Conjecture Make Conjectures Inductive reasoning - reasoning that uses a number of specific examples to arrive at a conclusion Conjecture

More information

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship. LOGIC In mathematical and everyday English language, we frequently use logic to express our thoughts verbally and in writing. We also use logic in numerous other areas such as computer coding, probability,

More information

Introduction to Logic

Introduction to Logic Section D.1 Statements and Truth Tables D1 Appendix D Introduction to Logic D.1 Statements and Truth Tables Statements Truth Tables Statements In everyday speech and in mathematics you make inferences

More information

Geometry. Unit 2- Reasoning and Proof. Name:

Geometry. Unit 2- Reasoning and Proof. Name: Geometry Unit 2- Reasoning and Proof Name: 1 Geometry Chapter 2 Reasoning and Proof ***In order to get full credit for your assignments they must me done on time and you must SHOW ALL WORK. *** 1. (2-1)

More information

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.2 Conditional Statements Copyright Cengage Learning. All rights reserved. Conditional Statements Let

More information

Logic Overview, I. and T T T T F F F T F F F F

Logic Overview, I. and T T T T F F F T F F F F Logic Overview, I DEFINITIONS A statement (proposition) is a declarative sentence that can be assigned a truth value T or F, but not both. Statements are denoted by letters p, q, r, s,... The 5 basic logical

More information

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional)

n logical not (negation) n logical or (disjunction) n logical and (conjunction) n logical exclusive or n logical implication (conditional) Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.6) TOPICS Propositional Logic Logical Operators Truth Tables Implication Logical Equivalence Inference Rules What you should know about propositional

More information

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0. Examples Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Example (1) Solve x 2 + (y 1) 2 = 0. The solution is x = 0 AND y = 1. [p q.] Example (2) Solve x(y 1) = 0. Examples Let

More information

Predicate Logic & Quantification

Predicate Logic & Quantification Predicate Logic & Quantification Things you should do Homework 1 due today at 3pm Via gradescope. Directions posted on the website. Group homework 1 posted, due Tuesday. Groups of 1-3. We suggest 3. In

More information

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

What is Logic? Introduction to Logic. Simple Statements. Which one is statement? What is Logic? Introduction to Logic Peter Lo Logic is the study of reasoning It is specifically concerned with whether reasoning is correct Logic is also known as Propositional Calculus CS218 Peter Lo

More information

Intro to Logic and Proofs

Intro to Logic and Proofs Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington

More information

A statement is a sentence that is definitely either true or false but not both.

A statement is a sentence that is definitely either true or false but not both. 5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial

More information

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set. Math 1312 Lesson 1: Sets, Statements, and Reasoning A set is any collection of objects. hese objects are called the elements of the set. A is a subset of B, if A is "contained" inside B, that is, all elements

More information

Logic. Def. A Proposition is a statement that is either true or false.

Logic. Def. A Proposition is a statement that is either true or false. Logic Logic 1 Def. A Proposition is a statement that is either true or false. Examples: Which of the following are propositions? Statement Proposition (yes or no) If yes, then determine if it is true or

More information

ECOM Discrete Mathematics

ECOM Discrete Mathematics ECOM 2311- Discrete Mathematics Chapter # 1 : The Foundations: Logic and Proofs Fall, 2013/2014 ECOM 2311- Discrete Mathematics - Ch.1 Dr. Musbah Shaat 1 / 85 Outline 1 Propositional Logic 2 Propositional

More information

Section 1.1: Logical Form and Logical Equivalence

Section 1.1: Logical Form and Logical Equivalence Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,

More information

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical

More information

Chapter 4 Reasoning and Proof Geometry

Chapter 4 Reasoning and Proof Geometry Chapter 4 Reasoning and Proof Geometry Name For 1 & 2, determine how many dots there would be in the 4 th and the 10 th pattern of each figure below. 1. 2. 3. Use the pattern below to answer the following:

More information

Mathematical Reasoning (Part I) 1

Mathematical Reasoning (Part I) 1 c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither

More information

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another.

Logic. Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. Math 0413 Appendix A.0 Logic Definition [1] A logic is a formal language that comes with rules for deducing the truth of one proposition from the truth of another. This type of logic is called propositional.

More information

Rules of Inference. Arguments and Validity

Rules of Inference. Arguments and Validity Arguments and Validity A formal argument in propositional logic is a sequence of propositions, starting with a premise or set of premises, and ending in a conclusion. We say that an argument is valid if

More information

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics

Unit I LOGIC AND PROOFS. B. Thilaka Applied Mathematics Unit I LOGIC AND PROOFS B. Thilaka Applied Mathematics UNIT I LOGIC AND PROOFS Propositional Logic Propositional equivalences Predicates and Quantifiers Nested Quantifiers Rules of inference Introduction

More information

2-1. Inductive Reasoning and Conjecture. Lesson 2-1. What You ll Learn. Active Vocabulary

2-1. Inductive Reasoning and Conjecture. Lesson 2-1. What You ll Learn. Active Vocabulary 2-1 Inductive Reasoning and Conjecture What You ll Learn Scan Lesson 2-1. List two headings you would use to make an outline of this lesson. 1. Active Vocabulary 2. New Vocabulary Fill in each blank with

More information

DERIVATIONS AND TRUTH TABLES

DERIVATIONS AND TRUTH TABLES DERIVATIONS AND TRUTH TABLES Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 3: DERIVATIONS AND TRUTH TABLES 1 / 65 WHAT

More information

Manual of Logical Style

Manual of Logical Style Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication

More information

Section 1.3: Valid and Invalid Arguments

Section 1.3: Valid and Invalid Arguments Section 1.3: Valid and Invalid Arguments Now we have developed the basic language of logic, we shall start to consider how logic can be used to determine whether or not a given argument is valid. In order

More information

Chapter 4, Logic using Propositional Calculus Handout

Chapter 4, Logic using Propositional Calculus Handout ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal

More information

Unit 2: Logic and Reasoning. start of unit

Unit 2: Logic and Reasoning. start of unit Unit 2: Logic and Reasoning Prior Unit: Introduction to Geometry Next Unit: Transversals By the end of this unit I will be able to: Skill Self-Rating start of unit Date(s) covered Self-Rating end of unit

More information

Read ahead and use your textbook to fill in the blanks. We will work the examples together.

Read ahead and use your textbook to fill in the blanks. We will work the examples together. Math 1312 Section 1.1 : Sets, Statements, and Reasoning Read ahead and use your textbook to fill in the blanks. We will work the examples together. A set is any. hese objects are called the of the set.

More information

Logic and Conditional Statements

Logic and Conditional Statements Logic and Conditional Statements Organizing topic Reasoning and Proof Overview Students investigate symbolic form while working with conditional statements. Related Standard of Learning G.1 Objectives

More information

Today s Topic: Propositional Logic

Today s Topic: Propositional Logic Today s Topic: Propositional Logic What is a proposition? Logical connectives and truth tables Translating between English and propositional logic Logic is the basis of all mathematical and analytical

More information

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~ MAT 101 Solutions Exam 2 (Logic, Part I) Multiple-Choice Questions 1. D Because this sentence contains exactly ten words, it is stating that it is false. But if it is taken to be false, then it has to

More information

Chapter 1 Elementary Logic

Chapter 1 Elementary Logic 2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help

More information

THE LOGIC OF COMPOUND STATEMENTS

THE LOGIC OF COMPOUND STATEMENTS CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form

More information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic.

Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. Natural Deduction is a method for deriving the conclusion of valid arguments expressed in the symbolism of propositional logic. The method consists of using sets of Rules of Inference (valid argument forms)

More information

Section 3.1 Statements, Negations, and Quantified Statements

Section 3.1 Statements, Negations, and Quantified Statements Section 3.1 Statements, Negations, and Quantified Statements Objectives 1. Identify English sentences that are statements. 2. Express statements using symbols. 3. Form the negation of a statement 4. Express

More information

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10

Logical Form 5 Famous Valid Forms. Today s Lecture 1/26/10 Logical Form 5 Famous Valid Forms Today s Lecture 1/26/10 Announcements Homework: --Read Chapter 7 pp. 277-298 (doing the problems in parts A, B, and C pp. 298-300 are recommended but not required at this

More information

Review: Potential stumbling blocks

Review: Potential stumbling blocks Review: Potential stumbling blocks Whether the negation sign is on the inside or the outside of a quantified statement makes a big difference! Example: Let T(x) x is tall. Consider the following: x T(x)

More information

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them.

Proofs. Example of an axiom in this system: Given two distinct points, there is exactly one line that contains them. Proofs A mathematical system consists of axioms, definitions and undefined terms. An axiom is assumed true. Definitions are used to create new concepts in terms of existing ones. Undefined terms are only

More information

Over Lesson 2 3 Identify the hypothesis and conclusion. If 6x 5 = 19, then x = 4. Identify the hypothesis and conclusion. A polygon is a hexagon if it

Over Lesson 2 3 Identify the hypothesis and conclusion. If 6x 5 = 19, then x = 4. Identify the hypothesis and conclusion. A polygon is a hexagon if it Five-Minute Check (over Lesson 2 3) Then/Now New Vocabulary Example 1: Real-World Example: Inductive and Deductive Reasoning Key Concept: Law of Detachment Example 2: Law of Detachment Example 3: Judge

More information

III. Elementary Logic

III. Elementary Logic III. Elementary Logic The Language of Mathematics While we use our natural language to transmit our mathematical ideas, the language has some undesirable features which are not acceptable in mathematics.

More information

DISCRETE STRUCTURES WEEK5 LECTURE1

DISCRETE STRUCTURES WEEK5 LECTURE1 DISCRETE STRUCTURES WEEK5 LECTURE1 Let s get started with... Logic! Spring 2010 CPCS 222 - Discrete Structures 2 Logic Crucial for mathematical reasoning Important for program design Used for designing

More information

15414/614 Optional Lecture 1: Propositional Logic

15414/614 Optional Lecture 1: Propositional Logic 15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,

More information

Unit 2: Geometric Reasoning Section 1: Inductive Reasoning

Unit 2: Geometric Reasoning Section 1: Inductive Reasoning Unit 2: Geometric Reasoning Section 1: Inductive Reasoning Ex #1: Find the next item in the pattern. January, March, May,... Ex #2: Find the next item in the pattern. 7, 14, 21, 28, Ex #3: Find the next

More information