《Discrete Mathematic with Applications》读书笔记一

Chapter1 The logic of compound statement

1.1 Logic Form and Logic Equivalence.

Translate the natural english argument to logic notation.

such as if p or q, then r.

Def1:

Proposition(statement):  A sentence that is true of false but not both.

exp he is a student. (is not a proposition, the truth and falsity depends on he)

x+y>0 (is not a proposition, the truth and falsity depends on variable X and Y)

Compound statement(proposition)

~ not (~p  negation of p)

^ and(p^q   conjunction of p and q)

V or (p V q  disjunction of p an q)

Order of operation: ~  > ^  = V

English word, and ,but(^)  , not (~),  or (V) 

Neither p nor q   (~p and ~q)

for inequality a < x < b.

The point of specifying x, a and b to particular real numbers is to ensure that sentence such as "x <a" and "x >=b"

are either true or false and hence that they a statements(proposition).

Truth Value

The negation of a statement is a statement that exactly expresses what it would mean for the statement to be false.

So the negation of a statement has opposite truth value from the statement.

intuitive logic, or sometimes mean exclusive(p or q but not both)   sometimes inclusive (p or q or both)

In formal logic, the or means inclusive

xor means exclusive

Exp 1.1.5 Construct the truth table for Exclusive or (XOR)

(p V q) ^ ~(p ^ q)