Statement and Trurh

1 A statement (or proposition) is a sentence that can be true or false, but not both simultaneously.

2 An atomic statement expresses a single idea.

3 We use logical connectives to form compound statements.

3.01 The most commonly used logical connectives are “and,” “or,” “if…then,” “if and only if,” and “not.”

3.011 “T and F” is always F.

3.012 “T or T” is always true and “F or T” is always T.

3.0121 The “inclusive or” is true when both statements are true, whereas the “exclusive or” is false when both statements are true.

3.013 “if T, then F” is always F .

3.014 “if F, then F” is always T.

3.015 “F if and only if T” is always F.

3.016 “not T” is always F.

4.010 𝑝 ∧ 𝑞 is called the conjunction(合并 ) of 𝑝 and 𝑞. It is pronounced “𝑝 and 𝑞”. 𝑝 ∧ 𝑞 is true when both
𝑝 and 𝑞 are true, and it is false otherwise.

4.011 𝑝 ∨ 𝑞 is called the disjunction of 𝑝 and 𝑞. It is pronounced “𝑝 or 𝑞.” 𝑝 ∨ 𝑞 is true when 𝑝 or 𝑞
(or both) are true, and it is false when 𝑝 and 𝑞 are both false.

4.012 𝑝 → 𝑞 is called a conditional or implication. It is pronounced “if 𝑝, then 𝑞” or “𝑝 implies 𝑞.”
𝑝 → 𝑞 is true when 𝑝 is false or 𝑞 is true (or both), and it is false when 𝑝 is true and 𝑞 is false.

4.013𝑝 ↔ 𝑞 is called a biconditional. It is pronounced “𝑝 if and only if 𝑞.” 𝑝 ↔ 𝑞 is true when 𝑝 and
𝑞 have the same truth value (both true or both false), and it is false when 𝑝 and 𝑞 have opposite
truth values (one true and the other false).

4.014 ¬𝑝 is called the negation of 𝑝. It is pronounced “not 𝑝.” ¬𝑝 is true when 𝑝 is false, and it is false
when 𝑝 is true (𝑝 and ¬𝑝 have opposite truth values.)
5.10

𝒑	𝒒	𝒑 ∧ 𝒒
𝐓	𝐓	𝐓
𝐓	F	F
F	𝐓	F
F	F	F

5.11

𝒑	𝒒	𝒑 ∨ 𝒒
𝐓	𝐓	𝐓
𝐓	F	𝐓
F	𝐓	𝐓
F	F	F

5.12

𝒑	𝒒	𝒑 → 𝒒
𝐓	𝐓	𝐓
𝐓	F	F
F	𝐓	𝐓
F	F	F

5.13

𝒑	𝒒	𝒑 ↔ 𝒒
𝐓	𝐓	𝐓
𝐓	F	F
F	𝐓	F
F	F	𝐓

5.14

𝒑	𝒑 ¬ 𝒒
𝐓	F
F	𝐓