0% found this document useful (0 votes)
16 views32 pages

Week1 Logic Proposition

Uploaded by

hoang huy nguyen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
16 views32 pages

Week1 Logic Proposition

Uploaded by

hoang huy nguyen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 32

University of Technologies and

Education

Logic Proposition
Lecturer: Truong Thi Ngoc Phuong
Table of contents
Definition of
Propositional Negation of
01 02
Logic proposition

03 Connectives 04 Exercises
What is Proposition?
A proposition is a declarative sentence (that is, a sentence that
declares a fact) that is either true or false, but not both

Example 1:
1. Washington, D.C., is the capital of the United States of America.
2. Toronto is the capital of Canada
3. 1 + 1 = 2
4. 2 + 2 = 3

Proposition 1 and 3 are true.


Proposition 2 and 4 are false.
Example 2:
Consider the following sentences:
1. What time is it?
2. Read this carefully
3. x + 1 = 2
4. x + y = z

Sentences 1, 2, 3, 4 are not proposition.


Propositional Variables
Propositional Variables
• We use letters to denote propositional variables (or statement variables)
• The conventional letters used for propositional variables are p, q, r, s…..

Truth Value
• The truth value of a proposition is true, denoted by T, if it is a true proposition.
• The truth value of a proposition is false, denoted by F, if it is a false proposition.
Before starting
something……
We should know about the history of that.
History of
Propositional
Logic
• The area of logic deals with propositions
are called the propositional calculus or
propositional logic.
• It was first developed systematically by the
Greek philosopher Aristotle more than
2300 years ago.
• Now we turn our attention to methods for
producing new propositions from those we
already have.
• These methods were discussed by the
English mathematician George Boole in
1854 in his book The Laws of Thought.
Negation of proposition – phủ định
Example 1:
Find the negation of the proposition
“Michael’s PC runs Linux”

and Express this in simple English.

Solution:
The negation is “It is not the case that Michael’s PC runs Linux”
This negation can be more simply expressed as “Michael’s PC does not run Linux”
Example 2:
Truth Table – Bảng chân trị

• Table 1 displays the truth table for the negation of a


proposition p.
• This table has a row for each of the two possible truth
values of a proposition p.
• Each row shows the truth value of ┐p corresponding
to the truth value of p for this row.
Negation Operators & Connectives
• The negation operator constructs a new proposition from a single existing
proposition.
• Logical operators used to form new propositions from two or more existing
propositions. These logical operators are also called connectives.
• There are some connectives:
1)Conjunctions
2)Disjunctions
3)Exclusive or
4)Conditional Statement
5)Biconditional Statement
Connectives
Conjunction – Nối liền (và)

• The Truth Table has a row for each of the four


possible combinations of truth values of p and q.
• The four rows correspond to the pairs of truth
values TT, TF, FT and FF.
Example 1: Conjunction
Find the conjunction of the propositions of p and q
p: “Rebecca’s PC has more than 16 GB free hard disk space”
q: “The processor in Rebecca’s PC runs faster than 1 GHz”

Solution:
The conjunction can be expressed more simply as “Rebecca’s PC has more than 16
GB free hard disk space, and its processor run faster than 1 GHz”.

For this conjunction to be true, both conditions given must be true.


It is false, when one or both of these conditions are false.
Disjunction – Nối rời (hay)

• The Truth Table has a row for each of the four


possible combinations of truth values of p and q.
• The four rows correspond to the pairs of truth
values TT, TF, FT and FF.
Example 1: Disjunction
Find the disjunction of the propositions of p and q
p: “Rebecca’s PC has more than 16 GB free hard disk space”
q: “The processor in Rebecca’s PC runs faster than 1 GHz”

Solution:
The conjunction can be expressed more simply as “Rebecca’s PC has more than 16
GB free hard disk space, or its processor run faster than 1 GHz”.

For this conjunction to be true, at least one of the two propositions given must be
true.
It is false, when both of these conditions are false.
Exclusive – Nối rời loại trừ (xor)

• The Truth Table has a row for each of the four


possible combinations of truth values of p and q.
• The four rows correspond to the pairs of truth
values TT, TF, FT and FF.
Conditional Statement (kéo theo)

• The Truth Table has a row for each of the four


possible combinations of truth values of p and q.
• The four rows correspond to the pairs of truth
values TT, TF, FT and FF.
Example 1: Conditional Statement
Find the conditional statement of the propositions of p and q
p: “Maria learns discrete mathematics”
q: “Maria will find a good job”

Solution:
The conjunction can be expressed more simply as “If Maria learns discrete
mathematics, then she will find a good job”.

For this conjunction to be false, if Maria learns discrete mathematics but she does
not find a good job.

Otherwise, this conjuction pq will be true.


Example 2: Conditional Statement
Find the conditional statement of the propositions of p and q
“If Juan has a smartphone, then 2 + 3 = 5

p: “Juan has a smartphone”


q: “2 + 3 = 5”

Solution:
The proposition q is true. Therefore proposition pq is always true no matter what p
is true or false.
Example 3: Conditional Statement
Find the conditional statement of the propositions of p and q
“If Juan has a smartphone, then 2 + 3 = 6”

p: “Juan has a smartphone”


q: “2 + 3 = 6”

Solution:
The proposition q is false.
If Juan does not have a smartphone then proposition p is false. Therefore, p q
proposition will be true. (F  F: True)
If Juan have a smartphone then proposition p is true. Therefore, p q proposition will
be false (TF: False)
Biconditional Statement (kéo theo 2
chiều)

• The Truth Table has a row for each of the four


possible combinations of truth values of p and q.
• The four rows correspond to the pairs of truth
values TT, TF, FT and FF.
Example 1: Biconditional
Statement
Find the biconditional statement of the propositions of p and q
p: “You can take the flight”
q: “You buy a ticket”

Solution: (p↔q)
The proposition p↔q is: “You can take the flight if and only if you buy a ticket”
The proposition p↔q is true if p and q are either both true or both false. Therefore:
* You take the flight and you buy a ticket: the biconditional statement is true (T ↔ T:
T)
* You cannot take the flight and you cannot buy a ticket: the biconditional statement
is true (F ↔ F: T)
Precedence of Logical Operators
Logic and Bit Operations
EXERCISES
Determine the truth table
Lập bảng chân trị
Determine the logic
proposition
Solution
Exercise: Determine the truth
table
a ) nếu 3+4=12 thì 3+2=6
b ) nếu 1+1=2 thì 1+2=3
c ) nếu 1+1=2 thì 1+2=4
Thanks!
Do you have any questions?
[email protected]
0942920912

You might also like