Unit 1 / Syllogistic Logic

Equivalent to “all A is B”

Every A is B Each A is B

Any A is B Whoever is A is B

A are B Those who are A are B

If a ______ is A, then _____ is B If you’re A, you’re B

No one is A unless they are B No one is A without being B

A thing is not A unless it is B It is false that some A is not B

Flipped Case

Only B are A None but B are A

Equivalent to “no A is B”

A are not B No one that is A is B

Every A is not B Each A is not B

Any A is not B There isn’t a single A that’s B

Whoever is A is not B Not any A is B

If a person is A, then they are not B It is false that there is an A that is B

If you are A then you are not B It is false that some A is B

Equivalent to “some A is B” Equivalent to “some A is not B”

A are sometimes B One or more A are B

One or more A are B There is A that are not B

There are A that are B Not all A are B

True Premise False Premise

True Conclusion Valid (Sound) or Invalid Valid or Invalid

False Conclusion Invalid Valid or Invalid

Contradictories

No A is B Some A is B

All A is B Some A is not B

 Unit 2 / Propositional Logic
Propositional Logic signs

~𝐴 Not A

(𝐴 · 𝐵) Both A and B

(𝐴 ∨ 𝐵) Either A or B

(𝐴 ⊃ 𝐵) If A then B

(𝐴 ≡ 𝐵) A if and only if B / iff

((𝐴 ∨ 𝐵) · ~(𝐴 · 𝐵)) A or B but not both / exclusive or

Propositional Logic Simplification / Manipulation Methods

Communication (𝐴 · 𝐵) = (𝐵 · 𝐴)

Association ((𝐴 · 𝐵) · 𝐶) = (𝐴 · (𝐵 · 𝐶))

Contrapositive (𝐴 ⊃ 𝐵) = (~𝐵 ⊃ ~𝐴)

De Morgan ~(𝐴 · 𝐵) = (~𝐴 ∨ ~𝐵) ~(𝐴 ∨ 𝐵) = (~𝐴 · ~𝐵)

(~𝐴 ⊃ 𝐵) = (𝐴 ∨ 𝐵) (𝐴 ⊃ 𝐵) = (~𝐴 ∨ 𝐵)

Truth Tables

A and B A or B - (normal) If A then B A iff B

𝐴 𝐵 (𝐴 · 𝐵) A 𝐵 (𝐴 ∨ 𝐵) 𝐴 𝐵 (𝐴 ⊃ 𝐵) 𝐴 𝐵 (𝐴 ≡ 𝐵)

0 0 0 0 0 0 0 0 1 0 0 1

0 1 0 0 1 1 0 1 1 0 1 0

1 0 0 1 0 1 1 0 0 1 0 0

1 1 1 1 1 1 1 1 1 1 1 1

Not A A or B - exclusive
𝐴 ~𝐴 𝐴 𝐵 (𝐴 ∨ 𝐵) (𝐴 · 𝐵) ~(𝐴 · 𝐵) (𝐴 ∨ 𝐵) · ~(𝐴 · 𝐵)

0 1 0 0 0 0 1 0

1 0 0 1 1 0 1 1

1 0 1 0 1 1

1 1 1 1 0 0
 Harder Translation

Category Phrase Propositional Logic / Alternative Forms

A and B

A but B
“and” (𝐴 · 𝐵)
A yet B
Equivalent (𝐵 · 𝐴)
A however B

A although B

A or B
“or” (𝐴 ∨ 𝐵) (~𝐴 ⊃ 𝐵)
A unless B
Equivalent (𝐵 ∨ 𝐴) (~𝐵 ⊃ 𝐴)
Unless A, B

A if and only if B
“iff” (𝐴 ≡ 𝐵)
A just if B
Equivalent (𝐵 ≡ 𝐴)
A iff B

If A, then B

Provided that A, B
“if”
Equivalent Assuming that A, B

To A, must B

B, if A
(𝐴 ⊃ 𝐵) (~𝐵 ⊃ ~𝐴)
“if” B, provided that A
Equivalent
Flipped B, assuming that A

B, in case A

“only if” A only if B

“only if” flipped Only if B, A

A is sufficient for B
(𝐴 ⊃ 𝐵) (~𝐵 ⊃ ~𝐴)
Necessary, B is necessary for A
Sufficient
A is necessary and (𝐴 ≡ 𝐵)
sufficient for B* (𝐵 ≡ 𝐴)
*technically the full expression is ((𝐴 ⊃ 𝐵) · (𝐵 ⊃ 𝐴)) which simplifies to A iff B
 Unit 3 / Proofs
S - rules (Simplifying)

Normal Alternative Wrong

AND (𝑃 · 𝑄) (~𝑃 · ~𝑄) ~(𝑃 · 𝑄)

𝑃, 𝑄 ~𝑃, ~𝑄 𝑛𝑖𝑙

NOR ~(𝑃 ∨ 𝑄) ~(~𝑃 ∨ ~𝑄) (𝑃 ∨ 𝑄)

(not-either)
~𝑃, ~𝑄 𝑃, 𝑄 𝑛𝑖𝑙

NIF ~(𝑃 ⊃ 𝑄) ~(~𝑃 ⊃ 𝑄) ~(𝑃 ⊃ ~𝑄) ~(~𝑃 ⊃ ~𝑄) (𝑃 ⊃ 𝑄)

(false if-then)
𝑃, ~𝑄 ~𝑃, ~𝑄 𝑃, 𝑄 ~𝑃, 𝑄 𝑛𝑖𝑙

IFF ~(𝐴 ≡ 𝐵) (𝐴 ≡ 𝐵)

(𝐴 ∨ 𝐵), (𝐴 ⊃ 𝐵),
~(𝐴 · 𝐵) (𝐵 ⊃ 𝐴)

I - Rules (Inferring)

Normal Alternative Wrong

conjunctive ~(𝑃 · 𝑄) ~(𝑃 · 𝑄) ~(~𝑃 · ~𝑄) ~(𝑃 · ~𝑄) ~(𝑃 · ~𝑄) ~(𝑃 · 𝑄)
syllogism 𝑃 𝑄 ~𝑃 𝑃 ~𝑄 ~𝑃

~𝑄 ~𝑃 𝑄 𝑄 ~𝑃 𝑛𝑖𝑙

disjunctive (𝑃 ∨ 𝑄) (𝑃 ∨ 𝑄) (~𝑃 ∨ ~𝑄) (𝑃 ∨ ~𝑄) (𝑃 ∨ ~𝑄) (𝑃 ∨ 𝑄)

syllogism ~𝑃 ~𝑄 𝑃 ~𝑃 𝑃 𝑃

𝑄 𝑃 ~𝑄 ~𝑄 𝑄 𝑛𝑖𝑙

modus (𝑃 ⊃ 𝑄) (~𝑃 ⊃ ~𝑄) (𝑃 ⊃ ~𝑄) (~𝑃 ⊃ 𝑄) (𝑃 ⊃ 𝑄)

ponens 𝑃 ~𝑃 𝑃 ~𝑃 ~𝑃
(if-then
affirming) 𝑄 ~𝑄 ~𝑄 𝑄 𝑛𝑖𝑙

modus (𝑃 ⊃ 𝑄) (~𝑃 ⊃ ~𝑄) (𝑃 ⊃ ~𝑄) (~𝑃 ⊃ 𝑄) (𝑃 ⊃ 𝑄)

tollens ~𝑄 𝑄 𝑄 ~𝑄 𝑄
(if-then
denying) ~𝑃 𝑃 ~𝑃 𝑃 𝑛𝑖𝑙