Name:_____________________ Date:__________________

Classwork

2-3

Syllogisms and Proofs

Use the following rules to change each word (each string of letters) into the other.
Next to each step, write down which rule you use.
1) Any letter can change into an A.
2) Two Cs in a row can turn into a B.
3) Any word can be doubled.
(1)

(2)

(3)

C
_____________
_____________
_____________
_____________
_____________
_____________
ACAC

B
_____________
_____________
_____________
_____________
_____________
_____________
ABAB

C
_____________
_____________
_____________
_____________
_____________
_____________
B

(4)
B
_____________
_____________
_____________
_____________
_____________
_____________
BABA

(5)
CB
_____________
_____________
_____________
_____________
_____________
_____________
AACB

(6)
C
_____________
_____________
_____________
_____________
_____________
_____________
CBA

(7)

(8)

(9)

CAC
_____________
_____________
_____________
_____________
_____________
_____________
CAAAC

CAC
_____________
_____________
_____________
_____________
_____________
_____________
CAAC

C
_____________
_____________
_____________
_____________
_____________
_____________
BACABC

(10)

(11)

C
_____________
_____________
_____________
_____________
_____________
_____________
AACB

CBC
_____________
_____________
_____________
_____________
_____________
_____________
ABAABC

(12)
CDCC
_____________
_____________
_____________
_____________
_____________
_____________
CDABAB

Compose three problems of your own below.

_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________

_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________

_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________

What do you find appealing or unappealing about this mathematical structure?

Think up three rules that we could add as Rule #4 and write these below. Pick one and give an
argument as to why this would be a good addition to the system.

Created by ______________!
Name _____________________
Use the following rules to change each word (each string of letters) into the other.
1) Any letter can change into an A.
2) Two Cs in a row can turn into a B.
3) Any word can be doubled.
4)

(1)

(2)

(3)

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

(4)

(5)

(6)

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

Created by ______________!
Name _____________________
Use the following rules to change each word (each string of letters) into the other.
1) Any letter can change into an A.
2) Two Cs in a row can turn into a B.
3) Any word can be doubled.
4)

(1)

(2)

(3)

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

(4)

(5)

(6)

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

_____________

Practice

2-3

Name:_____________________ Date:__________________

Syllogisms and Proofs

(1) Fill in the missing statement in the proof below.

If the electricity goes off during the night, your clock will be wrong.
If your clock is wrong, you wont realize what time it is.
Missing statement:_________________________________________________
Theorem: If the electricity goes off during the night, you will be late for school.
(2) Reorganize the proof below, writing it in logical order.
NASA would send some mice on a lunar mission if they were eager astronauts.
If mice were sent on a lunar mission, the eyes of the entire world would be watching them on
television.
If the moon were made of green cheese, mice would make eager astronauts.
It would be one giant peep for mouse kind if the eyes of the entire world were watching them on
television.

(3) Determine if each of the following is a valid or invalid direct proof (follows the law of syllogism).
a. If a duck flies upside-down, it gets dizzy.
If a duck gets dizzy, then it quacks up.
Therefore, if a duck flies upside-down, it quacks up.
b. If you go to Long Beach, you will see beautiful sunsets. I
If you are in Hawaii, you will see beautiful sunsets.
Therefore, if you go to Long Beach, then you are in Hawaii.
c. All donkeys have long ears.
All long-eared creatures are habitual eavesdroppers.
Therefore, all donkeys are habitual eavesdroppers.
d. The second batter on a major league baseball team is always a good hit-and-run player.
The second batter on a major league baseball team is always a good bunter.
Therefore, if someone on a major league baseball team is a good hit-and-run player, he is also a
good bunter.
e. People who shoplift are dishonest.
No dishonest person is trustworthy.
Therefore, people who shoplift are not trustworthy.

Use the following rules to change each word (each string of letters) into the other.
Write the number of the rule you use next to each step.
1) Any letter can change into an A.
2) Two Cs in a row can turn into a B.
3) Any word can be doubled.
(Louis)
B
_____________
_____________
_____________
_____________
_____________
_____________
CC

(Phineas)
CAC
_____________
_____________
_____________
_____________
_____________
_____________
CCAAAAAACC

(Max)
C
_____________
_____________
_____________
_____________
_____________
_____________
BCABBC

(Lily)
CCB
_____________
_____________
_____________
_____________
_____________
_____________
BBACBBBACB

(Oliver)
O
_____________
_____________
_____________
_____________
_____________
_____________
AAAA

(Nadia)
A
_____________
_____________
_____________
_____________
_____________
_____________
CC

(Tucker)
C
_____________
_____________
_____________
_____________
_____________
_____________
CBACBCA

(Laila)
BA
_____________
_____________
_____________
_____________
_____________
_____________
BAA

(Nina)
C
_____________
_____________
_____________
_____________
_____________
_____________
BXAC
For Ninas:
4) Four Cs can turn into an X.

Use the following rules to change each word (each string of letters) into the other.
1) Neighboring letters can switch places. MATH MTAH
2) The first and last letters of a word can switch places. GLAD DLAG
(1)
ARM
_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________
RAM

(2)
BALM
_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________
LAMB

(3)
LUMP
_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________
PLUM

(4)
CAUSE
_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________
SAUCE

(5)
TRACE
_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________
CATER

(6)
SHOTGUN
_____________
_____________
_____________
_____________
_____________
_____________
_____________
_____________
GUNSHOT

Can you come up with a problem of you own below?

A NEW SYSYEM
Use the following rules to change each word (each string of letters) into the other.
1) If the string ends in I, you can add a U onto the end. MUUIMUUIU
2) The string Msomething can become Msomethingsomething. MIIUMIIUIIU
3) III can change into U. MUIIIMUU
4) Any UU can be eliminated. MIIUUIMIII
(1)

(2)

(3)

MI
_____________
_____________
_____________
_____________
_____________
_____________
MIUIU

MUUI
_____________
_____________
_____________
_____________
_____________
_____________
MII

MI
_____________
_____________
_____________
_____________
_____________
_____________
MUI

(4)

(5)

(6)

M
_____________
_____________
_____________
_____________
_____________
_____________
MIU

MI
_____________
_____________
_____________
_____________
_____________
_____________
MIUUI

MUUI
_____________
_____________
_____________
_____________
_____________
_____________
MIUIU

(7)
MI
_____________
_____________
_____________
_____________
_____________
_____________
MU

(8)
MUUI
_____________
_____________
_____________
_____________
_____________
_____________
MIUU

(9)
MUUI
_____________
_____________
_____________
_____________
_____________
_____________
MIIIUII