Chapter I - Symbolic Logic

Proposition Logical operations Generation of operators Propositions with quantiers ,
Symbolic logics
NGUYEN CANH Nam1
1 Faculty of Applied Mathematics Department of Applied Mathematics and Informatics Hanoi University of Technologies namnc@mail.hut.edu.vn
HUT - 2010
NGUYEN CANH Nam
Mathematics I - Chapter 1
References
1
Nguyen Dinh Tri, Ta Van Dinh, Nguyen Ho Quynh, Toan hoc cap cap - Tap I, Nha xuat ban giao duc. Nguyen Van Nghi, Nguyen Canh Luong, Phuong phap giai bai tap toan cao cap - Tap I, Nha xuat ban khoa hoc va ky thuat. Kenneth H.Rosen, Discrete Mathematics and Its Applications, Mc Graw Hill, International edition 2007. D.A.R. Wallace, Groups, Rings and Fields, Springer 1998. Titu Andreescu and Dorin Andrica, Complex Numbers from A to. . . Z, Birkhuser Boston 2006. P.B.Bhattacharya S.K.Jain and S.R.Nagpaul, Basic Abstract Algebra, Cambridge University Press, Second edition, 1996. www...
NGUYEN CANH Nam Mathematics I - Chapter 1
4 5
Agenda
1 2
Proposition Logical operations Negation operator NOT Conjunction operator AND () Disjunction operator OR () Implication operator IMP () Equivalence operator IFF () Tautologies, contradictions Generation of operators Binary XOR operator Binary operator NOR () Binary Operator NAND ( ) Propositions with quantiers ,
Proposition
Denition A proposition is a statement which is either true or false, although we may not know which, but not both. Propositions are denoted by lower letters as p, q, r The truth or falsity is called truth value of the proposition. The truth value of the proposition p is denoted by V (p). If p is true then V (p) = 1 or T . If p is false then V (p) = 0 or F .
NGUYEN CANH Nam
Proposition
Examples
Example 1: p = "Hanoi is the capital of Vietnam" then V (p) = 1 q = "The sun rises in the east " then V (q) = 1 r = "1 + 1 = 2" then V (r ) = 1 s = "The sun rises in the west" then V (s) = 0 Example 2: The proposition t = "There exists life outside the earth". Up to now we can not know the truth value of the statement t.
NGUYEN CANH Nam
Proposition
Example (continue...)
Consider the following sentences

1 2 3
What time is it? Read this carefully x +1=2
Sentences 1 and 2 are not proposition because they are not declarative sentences.
NGUYEN CANH Nam
Negation operator NOT Conjunction operator AND () Disjunction operator OR () Implication operator IMP () Equivalence operator IFF () Tautologies, contradictions
Agenda
1 2
Negation operator NOT

Denition Let p be a proposition. The negation of p, denoted by p, is the statement "It is not the case that p" The truth table of NOT operator is as follow p 0 1 p 1 0
Table: NOT truth table
NGUYEN CANH Nam

Examples
Example 1 : Find the negation of the proposition "Today is Monday" The negation is "It is not the case that today is Monday" or simply "Today is not Monday"
NGUYEN CANH Nam

Examples
Example 2 : Find the negation of the proposition "At least 100mm of rain fell today in Hanoi" The negation is "It is not the case that at least 100mm of rain fell today in Hanoi" or simply "Less than 100mm of rain fell today in Hanoi"
NGUYEN CANH Nam
Agenda
1 2
Conjunction operator AND ()

Denition
Let p and q be propositions. The conjunction of p and q, denoted by p q, is the proposition "p and q". The truth table of AND operator is as follow p 0 0 1 1 q 0 1 0 1 pq 0 0 0 1
Table: AND truth table
Note : The conjunction p q is true when both p and q are true.

Conjunction operator AND ()

Example
Let p = "Pigs are mammals" and q = "Pigs y",
then p q is interpreted as "Pigs are ying mammals".
NGUYEN CANH Nam
Agenda
1 2
Disjunction operator OR ()
Denition
Let p and q be propositions. The disjunction of p and q, denoted by p q, is the proposition "p or q". The truth table of OR operator is as follow p 0 0 1 1 q 0 1 0 1 pq 0 1 1 1
Table: OR truth table Note : The disjunction p q is false when both p and q are false.
Disjunction operator OR ()
Example
Let p = "Today is Monday" and q = "It is raining today", then p q is interpreted as "Today is Monday or it is raining today". This proposition is true on any day that is either a Monday or a rainy day (including rainy Mondays).
NGUYEN CANH Nam
De Morgans Law
Theorem (De Morgans Law) For any two propositions p and q we have (i) V (p q) = V (p) V (q) (ii) V (p q) = V (p) V (q) Corollary The disjunction operator OR may be dened by NOT and AND operators: V (p q) = V (p q)
NGUYEN CANH Nam
Distributive Laws
Theorem (Distributive Laws) For any three propositions p, q, r , we have (i) V (p (q r )) = V ((p q) (p r )) (ii) V (p (q r )) = V ((p q) (p r ))
NGUYEN CANH Nam
Commutative and associative Laws
Theorem (Commutative and associative Laws) For any propositions p, q, r , we have (i) V (p q) = V (q p) (ii) V (p q) = V (q p) (iii) V ((p q) r ) = V (p (q r )) (iv) V ((p q) r ) = V (p (q r ))
NGUYEN CANH Nam
Agenda
1 2
Implication operator IMP ()

Denition
Let p and q be propositions. The implication p q is the proposition "If p then q". The truth table of IMP operator is as follow p 0 0 1 1 q 0 1 0 1 pq 1 1 0 1
Table: IMP truth table Note : The implication p q is false when p is true and q is false.

In implication p q, p is called the hypothesis and q is called the conclusion (or consequence) Because implication play such an essential role in mathematical reasoning, a variety of terminology is used to express p q "if p then q" "p is sufcient for q" "q follows from p" "p implies q" "a sufcient condition for q is p" "q unless p"
NGUYEN CANH Nam

Example
Let p = "Minh learns discrete mathematics" and q = "Minh will nd a good job", then p q
"If Minh learns discrete mathematics, then he will will a good job"
There are many other ways to express this condition statement, for examples
"Minh will nd a good job when he learns discrete mathematics" "For Minh to get a good job, it is sufcient for him to learns discrete mathematics" "Minh will nd a good job unless he does not learn discrete mathematics"
Assertion If p, q are propositions then we have (i) The proposition p (p q) is true, (ii) The proposition (p q) p is true. Theorem The implication operator IMP may be built from the negation operator NOT and the conjunction operator AND: V (p q) = V (p q)
NGUYEN CANH Nam
Agenda
1 2
Equivalence operator IFF ()

Denition
Let p and q be propositions. The equivalence p q is the proposition "p if and only if q". The truth table of IFF operator is as follow p 0 0 1 1 q 0 1 0 1 pq 1 0 0 1
Table: IFF truth table Note : The equivalence p q is true when p and q have the same truth value.

The equivalence p q is true when both implication p q and q p are true and is false otherwise. That is why we use the word "if and only if". Theorem For propositions p, q we have V (p q) = V ((p q) (q p)) There are some other common ways to express p q "p is necessary and sufcient for q" "if p then q, and conversely" "p iff q"

Example
Let p be the statement "You can take the ight" and let q be the statement "You buy a ticket". Then p q " You can take the ight if and only if you buy a ticket"
NGUYEN CANH Nam
Theorem The equivalence operator may be built from the negation operator NOT and the conjunction operator AND: V (p q) = V ((p q) (q p))
NGUYEN CANH Nam
Agenda
1 2
Tautologies
Denition A compound proposition is called a tautology if it is always true regardless truth values of atomic components.
NGUYEN CANH Nam
Tautologies
Examples
a) The proposition (p q) p is a tautology.

p 0 0 1 1 p 0 0 1 1 q 0 1 0 1 pq 0 1 1 1 q 0 1 0 1 pq 0 0 0 1 (p q) p 1 1 1 1 ((p q) p) q 1 1 1 1
b) ((p q) p) q is a tautology. The truth table is

(p q) p 0 1 0 0
NGUYEN CANH Nam
Contradictions
Denition A compound proposition is called a contradiction if its values are always false regardless truth values of atomic components.
NGUYEN CANH Nam
Contradictions
Examples
a) The proposition p p is a contradiction.

p 0 1 p 1 0 pp 0 0
b) The proposition (p q) p is a contradiction because the truth values of this are always false:
p 0 0 1 1 q 0 1 0 1 pq 0 0 0 1 (p q) p 0 0 0 0
NGUYEN CANH Nam
Binary XOR operator Binary operator NOR () Binary Operator NAND ( )
Agenda
1 2
Binary XOR operator ()

Denition Let p and q be propositions. The proposition p q is the proposition that is true when exactly one of p and q is true. The truth table of XOR operator is as follow p 0 0 1 1 q 0 1 0 1 pq 0 1 1 0
Table: XOR truth table

Binary XOR operator ()
Assertion The XOR operator is the negation of the IFF operator: V (pq) = V (p q)
NGUYEN CANH Nam
Agenda
1 2
Binary operator NOR ()

Denition Given two proposition p, q. The proposition p q is the proposition dened by the truth table p 0 0 1 1 q 0 1 0 1 pq 1 0 0 0
Table: NOR truth table
This means neither p nor q

Binary operator NOR ()
Assertion The operator NOR is negation of OR: V (p q) = V (p q)
NGUYEN CANH Nam
Agenda
1 2
Binary Operator NAND ( )

Denition Given two proposition p, q. The proposition p q is the proposition dened by the truth table p 0 0 1 1 q 0 1 0 1 pq 1 1 1 0
Table: NAND truth table
NGUYEN CANH Nam
Binary Operator NAND ( )
Assertion The operator NAND is negation of AND: V (p q) = V (p q)
NGUYEN CANH Nam
The universal quantier
Denition Let p(x) is a statement for x X . The universal quantication of P(x) is the statement "P(x) for all values of x in X The notation x P(x) denotes the universal quantication of P(x). Here is called the universal quantier. We read x P(x) as "for all x P(x)" or "for every x P(x)".
NGUYEN CANH Nam
The existential quatier
Denition Let p(x) is a statement for x X . The existential quantication of P(x) is the proposition "There is an element x in the domain such that P(x)" We use the notation x P(x) for existential quantication of P(x). Here is called existential quantier.
NGUYEN CANH Nam
Analogously, we have propositions as xy , P(x, y ); xy , P(x, y ) or xy , P(x, y ). In general, we have propositions containing , and a statement P(x1 , ..., xn ).
NGUYEN CANH Nam
Propositions with quantiers

Examples
Example 1 : a) The proposition "x IR, x2 + 1 0", is true. b) The proposition "x IR, x2 1 0", is false. c) The proposition "x IR, x2 1 0", is true. d) The proposition "x IR, y IR, x + y 0", is true. e) The proposition "y IR, x IR, x + y 0", is false.
NGUYEN CANH Nam

Examples (continue...)
Example 2 : The function f (x) is continuous at the point x0 if > 0, > 0, x, (|x x0 | < )(|f(x) f(x0 )| < ).
NGUYEN CANH Nam
Remark To receive the negation of a proposition containing qualiers , and statement P(x1 , ..., xn ), we change by , change by and change P(x1 , ..., xn ) by P(x1 , ..., xn ). In Example 2, using the above note we have that a function f (x) is not continuous at the point x0 if > 0, > 0, x, (|x x0 | < )(|f(x) f(x0 )| > ).
NGUYEN CANH Nam
Exercises
Exercise 1: Determine the truth table of the following composite propositions and state whether they are tautologies, contradictions or indeterminates? a) (p q) (p q) b) (p q) (p q)
NGUYEN CANH Nam
Exercises
Exercise 2: Write a logically equivalent statement using NOT, AND and OR. a) (p q) b) (p q) r
NGUYEN CANH Nam
Exercises
Exercise 3: To express the following proposition by symbolic logics: For subset A of IR , "m is called inmum of A, denoted by m = inf(A), if for all x in A, we have x isnt smaller as m and for all real number n, if x isnt smaller as n for all x in A then m isnt smaller as n".
NGUYEN CANH Nam
Exercises
Exercise 4: Determine the truth table of the following composite propositions and state whether they are tautologies, contradictions or indeterminate? a) (p q) p c) (p q) q e) ((p q) (q r ))) (p r ) g) (p q) (p q) b) p (q p) d) (p q) r f) (p q) (pq)
NGUYEN CANH Nam
Exercises
Exercise 5: Prove the following assertions a) V (pq) = V (p q) b) V (p q) = V (p q)
NGUYEN CANH Nam
Exercises
Exercise 6: Show that the logical operators NOT and OR are sufcient to generate AND, IFF, IMP, XOR, NOR and NAND.
NGUYEN CANH Nam

Chapter I - Symbolic Logic

Încărcat de

Informații document

Descriere originală:

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Chapter I - Symbolic Logic

Încărcat de

Drepturi de autor:

Formate disponibile

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Consider the following sentences

What time is it? Read this carefully x +1=2

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

Negation operator NOT

Table: NOT truth table

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Negation operator NOT

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Negation operator NOT

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

Conjunction operator AND ()

Table: AND truth table

Note : The conjunction p q is true when both p and q are true.

Proposition Logical operations Generation of operators Propositions with quantiers ,

Conjunction operator AND ()

Let p = "Pigs are mammals" and q = "Pigs y",

then p q is interpreted as "Pigs are ying mammals".

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Commutative and associative Laws

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

Implication operator IMP ()

Proposition Logical operations Generation of operators Propositions with quantiers ,

Implication operator IMP ()

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Implication operator IMP ()

Proposition Logical operations Generation of operators Propositions with quantiers ,

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,

Proposition Logical operations Generation of operators Propositions with quantiers ,

Equivalence operator IFF ()

Proposition Logical operations Generation of operators Propositions with quantiers ,

Equivalence operator IFF ()

Proposition Logical operations Generation of operators Propositions with quantiers ,

Equivalence operator IFF ()

NGUYEN CANH Nam

Proposition Logical operations Generation of operators Propositions with quantiers ,