SlideShare a Scribd company logo
1 of 46
Download to read offline
z
FORMAL LOGIC
Discrete Structures I
FOR-IAN V. SANDOVAL
z
Lesson 2
Logical Connectives
Source: Google Images
z
LEARNING OBJECTIVES
❑ Determine the truth values of an expression in propositional
logic
❑ Construct truth table for logical connectives
❑ Write an expression in propositional logic in a sentence
z
PROPOSITIONAL LOGIC
❑ the area of logic that deals with propositions
❑ A formal propositional written using propositional logic
notation, p, q, and r are used to represent statements. Also
called as propositional variables.
❑ i.e. Proposition p
❑ “Today is Monday.”
❑ True Values refer to the attribute assigned to a proposition
in respect of its truth or falsehood, which in classical logic
has only two possible values.
❑ True or T
❑ False or F
z
COMPOUND PROPOSITIONS (STATEMENTS)
❑ a statement composed of two or more simple statements
connected by logical connectives
❑ a simple statement could be used to build a compound
statement
❑ Examples:
❑ “2 + 6 = 9” and “man is a mammal”
❑ “The ocean is blue” or “It is cold today”
❑ “Discrete Structure is not a difficult course to me”
z
COMPOUND PROPOSITIONS (STATEMENTS)
❑ a statement composed of two or more simple statements
connected by logical connectives
❑ a simple statement could be used to build a compound
statement
❑ Examples:
❑ “2 + 6 = 9” and “man is a mammal”
❑ “The ocean is blue” or “It is cold today”
❑ “Discrete Structure is not a difficult course to me”
z
OPERATORS / CONNECTIVES
❑ an operator or connective combines one or more operand
expressions into larger expression.
❑ i.e. “+” in numeric expressions
❑ Unary operators take one operand
❑ i.e. -4
❑ Binary operators take two operands
❑ i.e. 3 x 5
❑ Ternary operators take three or more operands
❑ i.e. p? a:b in C and Java
❑ Propositional or Boolean Operators operate in
propositions or truth values instead of on numbers.
z
LOGICAL CONNECTIVES
❑ connectives are use to create a compound proposition from
two or more propositions
❑ there are six main logical connectives
❑ Negation
❑ Conjunction
❑ Disjunction
❑ Exclusive-or
❑ Conditional (Implication)
❑ Biconditional
z
LOGICAL CONNECTIVES
Operator
Formal Name
Nickname Operand
Type
Symbol
Negation Operator NOT Unary ¬, ∼, −, !
Conjunction Operator AND Binary ∧
Disjunction Operator OR Binary ∨
Exclusive –OR XOR Binary ⊕
Implication Operator IMPLIES Binary →
Biconditional Operator “if and only if” Binary ↔
z
LOGICAL CONNECTIVES
❑ Operator precedence is an ordering of logical operators
designed to allow the dropping of parentheses in logical
expressions.
Operator Precedence
¬ 1
∧ 2
∨ 3
→ 4
↔ 5
z
LOGICAL CONNECTIVES - NEGATION
❑ The negation of the statement p is written as ¬p, or
sometimes ∼p, −p, !p or p where the symbol for “NOT”
__
❑ It has the property that it is false when p is true, and true
when p is false
❑ The truth value of the negation of p, ¬p is the opposite of
the truth value of p
p ∼p
T F
F T
❑ The Truth Table for the Negation of a Proposition
z
LOGICAL CONNECTIVES - NEGATION
❑ Example.
The following are statements for p, find the corresponding
∼p.
1. 3 + 5 = 8.
2. Sofia is a girl.
3. Laisa is not here.
3 + 5 ≠ 8.
Sofia is not a girl or
Sofia is a boy.
Laisa is here.
z
LOGICAL CONNECTIVES - NEGATION
❑ common words associated for the Negation of a Proposition
Logical
Connectives
Logical
Expression
Word
Negation ¬p, ∼p, −p, !p, p’,
p
not p
It is false that p . . .
It is not the case
that p . . .
__
z
LOGICAL CONNECTIVES - NEGATION
❑ Example.
Find the negation of the proposition “Today is Friday”. And
express this in simple English.
❑ Solution.
“It is not the case that today is Friday.”
“It is false that today is Friday.”
❑ Simple English.
“Today is not Friday.”
“It is not Friday today.”
z
LOGICAL CONNECTIVES - NEGATION
❑ Example.
Find the negation of the proposition “At least 10 inches of
rain fell today in Miami”. And express this in simple English.
❑ Solution.
“It is not the case that at least 10 inches of rain fell today in
Siniloan, Laguna.”
❑ Simple English.
“Less than 10 inches of rain fell today in Siniloan, Laguna.”
z
LOGICAL CONNECTIVES - NEGATION
❑ Enrichment Exercise.
The following are statements for p, find the corresponding ∼p.
1. 23 is a composite number.
2. Earth has one moon.
3. Hexagon has five sides.
Find the negation of p (~p) and also negation of q (~q).
Let p = “It is not hot.”
q = “It is sunny.”
z
LOGICAL CONNECTIVES - CONJUNCTION
❑ The conjunction of the statement p and q is the compound
statement “p and q”.
❑ Symbolically, p ^ q, where ^ is the symbol for “and”
❑ It has the property that If p is true and q is true, then p ^ q is
true, otherwise p ^ q is false.
❑ The Truth Table for the Conjunction of Two Propositions
p q p ^ q
T T T
T F F
F T F
F F F
z
LOGICAL CONNECTIVES - CONJUNCTION
❑ Example:
Determine the truth value of each of the following
conjunction.
❑ 1. 2 + 6 = 9 and man is a mammal.
❑ 2. Manny Pacquiao is a boxing champion and Gloria
Macapagal Arroyo is the first female Philippine President.
❑ 3. Ferdinand Marcos is the only three-term Philippine
President and Joseph Estrada is the only Philippine
President who resigns.
Answer: False
Answer: False
Answer: True
z
LOGICAL CONNECTIVES - NEGATION
❑ common words associated for the Conjunction of Two
Propositions
Logical
Connectives
Logical
Expression
Word
Conjunction p ^ q p and q
p but q
p also q
p in addition q
p moreover q
z
LOGICAL CONNECTIVES - CONJUNCTION
❑ Example:
Find the conjunction of the propositions p and q where p is
the proposition “Today is Friday.” and q is the proposition “It is
raining today.” and the truth value of the conjunction.
Solution:
“Today is Friday and it is raining today.”
The proposition is true on rainy Fridays.
z
LOGICAL CONNECTIVES - CONJUNCTION
❑ Example:
If p = “I will have salad for lunch.” and
q = “I will have steak for dinner.”
p ∧ q = ?
Solution:
“I will have salad for lunch and I will have steak for dinner”.
“I will have salad for lunch and steak for dinner.”
z
LOGICAL CONNECTIVES - CONJUNCTION
❑ Enrichment Exercise.
Determine the truth values of each of the following
conjunction.
1. The earth is triangle and the moon is square.
2. Square has four sides and snakes are mammals.
3. Apple is a fruit and butterflies are insects.
Let p = “It is hot.” and q = “It is sunny.”
Find p and q (p ∧ q)
z
LOGICAL CONNECTIVES - DISJUNCTION
❑ The disjunction of the statement p and q is the compound
statement “p or q”.
❑ Symbolically, p v q, where v is the symbol for “or”
❑ It has the property that if p is true and q is true or both p
and q are true, then p v q is true, otherwise p v q is false.
❑ The Truth Table for the Disjunction of Two Propositions
p q p v q
T T T
T F T
F T T
F F F
z
LOGICAL CONNECTIVES - DISJUNCTION
❑ Example:
Determine the truth value of each of the following
disjunction.
1. 2 + 6 = 9 or Manny Pacquiao is a boxing champion.
2. Joseph Estrada is the only Philippine President who resigns
or Gloria Macapagal Arroyo is the first female Philippine
President.
3. Ferdinand Marcos is the only three-term Philippine
President or man is a mammal.
Answer: True
Answer: False
Answer: True
z
LOGICAL CONNECTIVES - DISJUNCTION
❑ common words associated for the Disjunction of Two
Propositions
Logical
Connectives
Logical
Expression
Word
Disjunction p v q p or q
z
LOGICAL CONNECTIVES - DISJUNCTION
❑ Example:
p = “Today is Friday.”
q = “It is raining today.”
p v q = ?
Solution:
“Today is Friday or it is raining today.”
❑ Example:
p = “My car has a bad engine.”
q = “My car has a bad carburetor.”
p v q = “My car has a bad engine or my car has a bad
carburetor.”
z
LOGICAL CONNECTIVES - DISJUNCTION
❑ Enrichment Exercises
Determine the truth values of each of the following
disjunction.
1. COBOL is a programming language or 2 + 5 = 7.
2. Windows 2010 is an operating system or 15 is a prime
number.
3. 5 is less than 3 or 6 – 1 = 6.
Answer: True
Answer: True
Answer: False
z
LOGICAL CONNECTIVES – EXCLUSIVE OR
❑ The exclusive-or of the statement p and q is the compound
statement “p exclusive-or q”.
❑ Symbolically, p ⊕ q, where ⊕ is the symbol for “if and only
if”.
❑ If p and q are true or both false, then p ⊕ q is false; if p and
q have opposite truth values, then p ⊕ q is true.
❑ It can be noted that the truth values of p ⊕ q is the negation
of the truth values of p ↔ q.
❑ It has nice reversibility properties (e.g. p ⊕ (p ⊕ q) always
has the same truth-value as q).
z
LOGICAL CONNECTIVES – EXCLUSIVE OR
❑ The Truth Table for the Exclusive-or of Two Propositions
p q p ⊕ q
T T F
T F T
F T T
F F F
z
LOGICAL CONNECTIVES – EXCLUSIVE-OR
❑ common words associated for the Exclusive-or of Two
Propositions
Logical
Connectives
Logical
Expression
Word
Exclusive -or p ⊕ q
p v q
p exclusive-or q
z
LOGICAL CONNECTIVES – EXCLUSIVE OR
❑ Example
p = “Today is Friday.”
q = “It is raining today.”
p ⊕ q: = “Today is Friday exclusive or in it’s raining “today”.
The circuit is either on or off but not both.
Let ab<0, then either a<0 or b<0 but not both.
You may have cake or ice cream but not both.
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ The conditional (or implication ) of the statement p and q is
the compound statement “if p then q”.
❑ Symbolically, p → q, where → is the symbol for “if then”.
❑ p is called hypothesis (or antecedent or premise) and q is
called conclusion (consequent or consequences).
❑ The conditional statement p → q is false only when p is true
and q is false; otherwise p → q is true.
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ The Truth Table for the Conditional of Two Propositions
p q p → q
T T T
T F F
F T T
F F T
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ Example:
Obtain the truth values of each of the following conditional
statements.
1. If vinegar is sweet, then sugar is sour.
2. 2 + 5 = 7 is a sufficient condition for 5 + 6 = 1.
3. 14 – 8 = 4 is a necessary condition that 6 ÷ 3 = 2.
Answer: True
Answer: False
Answer: True
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ common words associated for the Implications of Two
Propositions
Logical
Connectives
Logical
Expression
Word
Conditional p → q If p, then q
If p, q
p is sufficient for q
p implies q
p only if q
p therefore q
p is stronger than q
p is sufficient condition for q
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ common words associated for the Implications of Two
Propositions
Logical
Connectives
Logical
Expression
Word
Conditional p → q q if p
q when p
q follows from p
q whenever p
q is necessary for p
q is weaker than p
q is a necessary condition for p
q unless ~p
a sufficient condition for q is p
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ Example
Let p = “You study hard.”
q = “You will get an excellent grade.”
p → q = “If you study hard, then you will get an excellent
grade.”
= “You will get an excellent grade when you study
hard.”
If you buy air ticket in advance, it is cheaper.
If it rains, the grass gets wet.
If 3+3=7, then all carabaos are white.
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ Other conditional statements:
❑ Converse of p → q : q → p
p → q: “If it is noon, then I am hungry.”
q → p: “If I am hungry, then it is noon.”
❑ Contrapositive of p → q : ~q → ~p
p → q: “If it is noon, then I am hungry.”
~q → ~p: “If I am not hungry, then it is not noon.”
❑ Inverse of p → q : ~p → ~q
p → q: “If it is noon, then I am hungry.”
~p → ~q: “If it is not noon, then I am not hungry.”
z
LOGICAL CONNECTIVES – BICONDITIONAL
❑ The biconditional of the statement p and q is the
compound statement “p if and only if q”.
❑ Symbolically, p ↔ q, where ↔ is the symbol for “if and only
if”.
❑ It has the property of if p and q are true or both false, then p
↔ q is true; if p and q have opposite truth values, then p ↔
q is false.
❑ Biconditional statements are also called bi-implications.
z
LOGICAL CONNECTIVES – BICONDITIONAL
❑ The Truth Table for the Biconditional of Two Propositions
p q p ↔ q
T T T
T F F
F T F
F F T
z
LOGICAL CONNECTIVES – BICONDITIONAL
❑ Example:
Determine the truth values of each of the following
biconditional statements.
1. 2 + 8 = 10 if and only if 6 – 3 = 3.
2. Manila is the capital of the Philippines is equivalent to
fish live in moon.
3. 8 – 2 = 5 is a necessary and sufficient for 4 + 2 = 7.
Answer: True
Answer: False
Answer: True
z
LOGICAL CONNECTIVES – CONDITIONAL
❑ common words associated for the Biconditional of Two
Propositions
Logical
Connectives
Logical
Expression
Word
Biconditional p ↔ q p if and only if q
p is equivalent to q
p is necessary and
sufficient condition for q
z
LOGICAL CONNECTIVES – BICONDITIONAL
❑ Example
Let p = “You can take the flight.”
q = “You buy a ticket.”
p ↔ q = “You can take the flight if and only if you buy a
ticket.”
Let p = “Pacquiao wins the senatorial election.”
q = “Pacquiao will be Senate President for all.”
p ↔ q = “If, and only if, Pacquiao wins the senatorial
election, Pacquiao will be Senate President for all.”
z
LOGICAL CONNECTIVES – BICONDITIONAL
❑ Enrichment Exercise
Determine the truth values of each of the following
biconditional statements.
1. 8 + 4 = 5 if and only if 7 is less than 13.
2. 3 is a composite number is equivalent to 11 is a prime
number.
3. 6 is divisible by 3 is a necessary and sufficient for 2 + 7 =
9.
z
LOGICAL CONNECTIVES
❑ For any two proposition p and q
z
• Levin, O. (2019). Discrete Mathematics: An Open Introduction 3rd Edition. Colorado: School of Mathematics Science
University of Colorado.
• Aslam, A. (2016). Proposition in Discrete Mathematics retrieved from https://www.slideshare.net/AdilAslam4/chapter-1-
propositions-in-discrete-mathematics
• Operator Precedence retrieved from http://intrologic.stanford.edu/glossary/operator_precedence.html
REFERENCES

More Related Content

What's hot

Truth tables
Truth tablesTruth tables
Truth tableswalkerlj
 
Mathematical Logic
Mathematical LogicMathematical Logic
Mathematical LogicJoey Valdriz
 
Unit I discrete mathematics lecture notes
Unit I  discrete mathematics lecture notesUnit I  discrete mathematics lecture notes
Unit I discrete mathematics lecture notesGIRIM8
 
1.3.2 Conditional Statements
1.3.2 Conditional Statements1.3.2 Conditional Statements
1.3.2 Conditional Statementssmiller5
 
Discrete Mathematics Lecture
Discrete Mathematics LectureDiscrete Mathematics Lecture
Discrete Mathematics LectureGenie Rose Santos
 
Sets of Axioms and Finite Geometries
Sets of Axioms and Finite GeometriesSets of Axioms and Finite Geometries
Sets of Axioms and Finite GeometriesSamuel John Parreño
 
Discrete Structures. Lecture 1
 Discrete Structures. Lecture 1  Discrete Structures. Lecture 1
Discrete Structures. Lecture 1 Ali Usman
 
Method of direct proof
Method of direct proofMethod of direct proof
Method of direct proofAbdur Rehman
 
union and intersection of events.ppt
union and intersection of events.pptunion and intersection of events.ppt
union and intersection of events.pptIzah Catli
 
Discrete Structures lecture 2
 Discrete Structures lecture 2 Discrete Structures lecture 2
Discrete Structures lecture 2Ali Usman
 
Logical Operators in Brief with examples
Logical Operators in Brief with examplesLogical Operators in Brief with examples
Logical Operators in Brief with examplesMujtaBa Khan
 
Propositional Logic (Descreate Mathematics)
Propositional Logic (Descreate Mathematics)Propositional Logic (Descreate Mathematics)
Propositional Logic (Descreate Mathematics)Abdullah Al Amin
 

What's hot (20)

Truth tables
Truth tablesTruth tables
Truth tables
 
Mathematical Logic
Mathematical LogicMathematical Logic
Mathematical Logic
 
Unit I discrete mathematics lecture notes
Unit I  discrete mathematics lecture notesUnit I  discrete mathematics lecture notes
Unit I discrete mathematics lecture notes
 
Lesson plan (1)
Lesson plan (1)Lesson plan (1)
Lesson plan (1)
 
1.3.2 Conditional Statements
1.3.2 Conditional Statements1.3.2 Conditional Statements
1.3.2 Conditional Statements
 
Discrete Mathematics Lecture
Discrete Mathematics LectureDiscrete Mathematics Lecture
Discrete Mathematics Lecture
 
Truth table
Truth tableTruth table
Truth table
 
Proposition (Logic)
Proposition (Logic)Proposition (Logic)
Proposition (Logic)
 
Sets of Axioms and Finite Geometries
Sets of Axioms and Finite GeometriesSets of Axioms and Finite Geometries
Sets of Axioms and Finite Geometries
 
Formal Logic - Lesson 7 - Rules of Inference
Formal Logic - Lesson 7 - Rules of InferenceFormal Logic - Lesson 7 - Rules of Inference
Formal Logic - Lesson 7 - Rules of Inference
 
Discrete Structures. Lecture 1
 Discrete Structures. Lecture 1  Discrete Structures. Lecture 1
Discrete Structures. Lecture 1
 
Propositional logic
Propositional logicPropositional logic
Propositional logic
 
Logic - Logical Propositions
Logic - Logical Propositions Logic - Logical Propositions
Logic - Logical Propositions
 
Mathematical Logic
Mathematical LogicMathematical Logic
Mathematical Logic
 
Method of direct proof
Method of direct proofMethod of direct proof
Method of direct proof
 
Logic&proof
Logic&proofLogic&proof
Logic&proof
 
union and intersection of events.ppt
union and intersection of events.pptunion and intersection of events.ppt
union and intersection of events.ppt
 
Discrete Structures lecture 2
 Discrete Structures lecture 2 Discrete Structures lecture 2
Discrete Structures lecture 2
 
Logical Operators in Brief with examples
Logical Operators in Brief with examplesLogical Operators in Brief with examples
Logical Operators in Brief with examples
 
Propositional Logic (Descreate Mathematics)
Propositional Logic (Descreate Mathematics)Propositional Logic (Descreate Mathematics)
Propositional Logic (Descreate Mathematics)
 

Similar to Formal Logic - Lesson 2 - Logical Connectives

Laws of Logic in Discrete Structures and their applications
Laws of Logic in Discrete Structures and their applicationsLaws of Logic in Discrete Structures and their applications
Laws of Logic in Discrete Structures and their applicationsZenLooper
 
logic, preposition etc
logic, preposition etclogic, preposition etc
logic, preposition etcAbdur Rehman
 
Discrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete MathematicsDiscrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete MathematicsAbdulRehman378540
 
Drinkfromme.pptx
Drinkfromme.pptxDrinkfromme.pptx
Drinkfromme.pptxRavind8
 
UGC NET Computer Science & Application book.pdf [Sample]
UGC NET Computer Science & Application book.pdf  [Sample]UGC NET Computer Science & Application book.pdf  [Sample]
UGC NET Computer Science & Application book.pdf [Sample]DIwakar Rajput
 
6-Math-Logic.pptx Math logic general mathematics
6-Math-Logic.pptx Math logic general mathematics6-Math-Logic.pptx Math logic general mathematics
6-Math-Logic.pptx Math logic general mathematicsMJ Barroga
 
Chapter 01 - p1.pdf
Chapter 01 - p1.pdfChapter 01 - p1.pdf
Chapter 01 - p1.pdfsmarwaneid
 
Propositional Logic.pdf
Propositional Logic.pdfPropositional Logic.pdf
Propositional Logic.pdfZLEMORHAN3
 
CSE-203 Lec_1.pptx
CSE-203 Lec_1.pptxCSE-203 Lec_1.pptx
CSE-203 Lec_1.pptxMahdiHasan86
 
Konjungsi materi kelompok dua
Konjungsi  materi kelompok duaKonjungsi  materi kelompok dua
Konjungsi materi kelompok duaLois Tulangow
 
Logic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptxLogic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptxPriyalMayurManvar
 
Discrete mathematics Chapter1 presentation.ppt
Discrete mathematics Chapter1 presentation.pptDiscrete mathematics Chapter1 presentation.ppt
Discrete mathematics Chapter1 presentation.pptNandiniSR2
 
Artificial Intelligence - Propositional Logic
Artificial Intelligence - Propositional LogicArtificial Intelligence - Propositional Logic
Artificial Intelligence - Propositional LogicSaravanan T.M
 

Similar to Formal Logic - Lesson 2 - Logical Connectives (20)

Laws of Logic in Discrete Structures and their applications
Laws of Logic in Discrete Structures and their applicationsLaws of Logic in Discrete Structures and their applications
Laws of Logic in Discrete Structures and their applications
 
logic, preposition etc
logic, preposition etclogic, preposition etc
logic, preposition etc
 
Propositional logic
Propositional logicPropositional logic
Propositional logic
 
Discrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete MathematicsDiscrete Structure vs Discrete Mathematics
Discrete Structure vs Discrete Mathematics
 
Drinkfromme.pptx
Drinkfromme.pptxDrinkfromme.pptx
Drinkfromme.pptx
 
Chapter1p1
Chapter1p1Chapter1p1
Chapter1p1
 
Chapter1p1.pdf
Chapter1p1.pdfChapter1p1.pdf
Chapter1p1.pdf
 
UGC NET Computer Science & Application book.pdf [Sample]
UGC NET Computer Science & Application book.pdf  [Sample]UGC NET Computer Science & Application book.pdf  [Sample]
UGC NET Computer Science & Application book.pdf [Sample]
 
6-Math-Logic.pptx Math logic general mathematics
6-Math-Logic.pptx Math logic general mathematics6-Math-Logic.pptx Math logic general mathematics
6-Math-Logic.pptx Math logic general mathematics
 
Chapter1p1 2.pptx
Chapter1p1 2.pptxChapter1p1 2.pptx
Chapter1p1 2.pptx
 
Chapter 01 - p1.pdf
Chapter 01 - p1.pdfChapter 01 - p1.pdf
Chapter 01 - p1.pdf
 
logicj-160412050513.pptx
logicj-160412050513.pptxlogicj-160412050513.pptx
logicj-160412050513.pptx
 
L01.ppt
L01.pptL01.ppt
L01.ppt
 
Propositional Logic.pdf
Propositional Logic.pdfPropositional Logic.pdf
Propositional Logic.pdf
 
CSE-203 Lec_1.pptx
CSE-203 Lec_1.pptxCSE-203 Lec_1.pptx
CSE-203 Lec_1.pptx
 
Konjungsi materi kelompok dua
Konjungsi  materi kelompok duaKonjungsi  materi kelompok dua
Konjungsi materi kelompok dua
 
Logic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptxLogic in Computer Science Unit 2 (1).pptx
Logic in Computer Science Unit 2 (1).pptx
 
Discrete mathematics Chapter1 presentation.ppt
Discrete mathematics Chapter1 presentation.pptDiscrete mathematics Chapter1 presentation.ppt
Discrete mathematics Chapter1 presentation.ppt
 
Artificial Intelligence - Propositional Logic
Artificial Intelligence - Propositional LogicArtificial Intelligence - Propositional Logic
Artificial Intelligence - Propositional Logic
 
1. Logic.pptx
1. Logic.pptx1. Logic.pptx
1. Logic.pptx
 

More from Laguna State Polytechnic University

Exploring the Difference Between Information Technology and Information System
Exploring the Difference Between Information Technology and Information SystemExploring the Difference Between Information Technology and Information System
Exploring the Difference Between Information Technology and Information SystemLaguna State Polytechnic University
 

More from Laguna State Polytechnic University (20)

Number Theory - Lesson 1 - Introduction to Number Theory
Number Theory - Lesson 1 - Introduction to Number TheoryNumber Theory - Lesson 1 - Introduction to Number Theory
Number Theory - Lesson 1 - Introduction to Number Theory
 
Formal Logic - Lesson 8 - Predicates and Quantifiers
Formal Logic - Lesson 8 - Predicates and QuantifiersFormal Logic - Lesson 8 - Predicates and Quantifiers
Formal Logic - Lesson 8 - Predicates and Quantifiers
 
Machine Learning Algorithms (Part 1)
Machine Learning Algorithms (Part 1)Machine Learning Algorithms (Part 1)
Machine Learning Algorithms (Part 1)
 
Artificial Intelligence Algorithms
Artificial Intelligence AlgorithmsArtificial Intelligence Algorithms
Artificial Intelligence Algorithms
 
Formal Logic - Lesson 6 - Switching Circuits
Formal Logic - Lesson 6 - Switching CircuitsFormal Logic - Lesson 6 - Switching Circuits
Formal Logic - Lesson 6 - Switching Circuits
 
Formal Logic - Lesson 5 - Logical Equivalence
Formal Logic - Lesson 5 - Logical EquivalenceFormal Logic - Lesson 5 - Logical Equivalence
Formal Logic - Lesson 5 - Logical Equivalence
 
Formal Logic - Lesson 3 - Truth Tables
Formal Logic - Lesson 3 - Truth TablesFormal Logic - Lesson 3 - Truth Tables
Formal Logic - Lesson 3 - Truth Tables
 
Formal Logic - Lesson 1 - Introduction to Logic
Formal Logic - Lesson 1 - Introduction to LogicFormal Logic - Lesson 1 - Introduction to Logic
Formal Logic - Lesson 1 - Introduction to Logic
 
Ethical Issues and Relevant Laws on Computing
Ethical Issues and Relevant Laws on ComputingEthical Issues and Relevant Laws on Computing
Ethical Issues and Relevant Laws on Computing
 
Number Systems Basic Concepts
Number Systems Basic ConceptsNumber Systems Basic Concepts
Number Systems Basic Concepts
 
Number Systems Basic Concepts
Number Systems Basic ConceptsNumber Systems Basic Concepts
Number Systems Basic Concepts
 
Exploring the Difference Between Information Technology and Information System
Exploring the Difference Between Information Technology and Information SystemExploring the Difference Between Information Technology and Information System
Exploring the Difference Between Information Technology and Information System
 
Introduction to Data Science
Introduction to Data ScienceIntroduction to Data Science
Introduction to Data Science
 
Introduction to Computers
Introduction to ComputersIntroduction to Computers
Introduction to Computers
 
Introduction to Computing Logic Formulation
Introduction to Computing Logic FormulationIntroduction to Computing Logic Formulation
Introduction to Computing Logic Formulation
 
Oasis of Sparkling and Refreshing Truisms
Oasis of Sparkling and Refreshing TruismsOasis of Sparkling and Refreshing Truisms
Oasis of Sparkling and Refreshing Truisms
 
My Teacher Got IT v2.0 - Software Installation Track
My Teacher Got IT v2.0 - Software Installation TrackMy Teacher Got IT v2.0 - Software Installation Track
My Teacher Got IT v2.0 - Software Installation Track
 
A Case Study on Issues and Violations on Information Technology
A Case Study on Issues and Violations on Information TechnologyA Case Study on Issues and Violations on Information Technology
A Case Study on Issues and Violations on Information Technology
 
Centralized Learning and Assessment Tool
Centralized Learning and Assessment Tool Centralized Learning and Assessment Tool
Centralized Learning and Assessment Tool
 
E-commerce Security and Payment
E-commerce Security and PaymentE-commerce Security and Payment
E-commerce Security and Payment
 

Recently uploaded

Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)Mark Reed
 
ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...
ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...
ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...JhezDiaz1
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfTechSoup
 
Like-prefer-love -hate+verb+ing & silent letters & citizenship text.pdf
Like-prefer-love -hate+verb+ing & silent letters & citizenship text.pdfLike-prefer-love -hate+verb+ing & silent letters & citizenship text.pdf
Like-prefer-love -hate+verb+ing & silent letters & citizenship text.pdfMr Bounab Samir
 
Barangay Council for the Protection of Children (BCPC) Orientation.pptx
Barangay Council for the Protection of Children (BCPC) Orientation.pptxBarangay Council for the Protection of Children (BCPC) Orientation.pptx
Barangay Council for the Protection of Children (BCPC) Orientation.pptxCarlos105
 
Science 7 Quarter 4 Module 2: Natural Resources.pptx
Science 7 Quarter 4 Module 2: Natural Resources.pptxScience 7 Quarter 4 Module 2: Natural Resources.pptx
Science 7 Quarter 4 Module 2: Natural Resources.pptxMaryGraceBautista27
 
Grade 9 Q4-MELC1-Active and Passive Voice.pptx
Grade 9 Q4-MELC1-Active and Passive Voice.pptxGrade 9 Q4-MELC1-Active and Passive Voice.pptx
Grade 9 Q4-MELC1-Active and Passive Voice.pptxChelloAnnAsuncion2
 
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...Nguyen Thanh Tu Collection
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxthorishapillay1
 
Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Celine George
 
ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4MiaBumagat1
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSJoshuaGantuangco2
 
Keynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designKeynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designMIPLM
 
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)lakshayb543
 
Karra SKD Conference Presentation Revised.pptx
Karra SKD Conference Presentation Revised.pptxKarra SKD Conference Presentation Revised.pptx
Karra SKD Conference Presentation Revised.pptxAshokKarra1
 
Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...Jisc
 

Recently uploaded (20)

Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)Influencing policy (training slides from Fast Track Impact)
Influencing policy (training slides from Fast Track Impact)
 
ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...
ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...
ENGLISH 7_Q4_LESSON 2_ Employing a Variety of Strategies for Effective Interp...
 
Raw materials used in Herbal Cosmetics.pptx
Raw materials used in Herbal Cosmetics.pptxRaw materials used in Herbal Cosmetics.pptx
Raw materials used in Herbal Cosmetics.pptx
 
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdfInclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
Inclusivity Essentials_ Creating Accessible Websites for Nonprofits .pdf
 
YOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptx
YOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptxYOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptx
YOUVE_GOT_EMAIL_PRELIMS_EL_DORADO_2024.pptx
 
Like-prefer-love -hate+verb+ing & silent letters & citizenship text.pdf
Like-prefer-love -hate+verb+ing & silent letters & citizenship text.pdfLike-prefer-love -hate+verb+ing & silent letters & citizenship text.pdf
Like-prefer-love -hate+verb+ing & silent letters & citizenship text.pdf
 
Barangay Council for the Protection of Children (BCPC) Orientation.pptx
Barangay Council for the Protection of Children (BCPC) Orientation.pptxBarangay Council for the Protection of Children (BCPC) Orientation.pptx
Barangay Council for the Protection of Children (BCPC) Orientation.pptx
 
Science 7 Quarter 4 Module 2: Natural Resources.pptx
Science 7 Quarter 4 Module 2: Natural Resources.pptxScience 7 Quarter 4 Module 2: Natural Resources.pptx
Science 7 Quarter 4 Module 2: Natural Resources.pptx
 
Grade 9 Q4-MELC1-Active and Passive Voice.pptx
Grade 9 Q4-MELC1-Active and Passive Voice.pptxGrade 9 Q4-MELC1-Active and Passive Voice.pptx
Grade 9 Q4-MELC1-Active and Passive Voice.pptx
 
OS-operating systems- ch04 (Threads) ...
OS-operating systems- ch04 (Threads) ...OS-operating systems- ch04 (Threads) ...
OS-operating systems- ch04 (Threads) ...
 
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
HỌC TỐT TIẾNG ANH 11 THEO CHƯƠNG TRÌNH GLOBAL SUCCESS ĐÁP ÁN CHI TIẾT - CẢ NĂ...
 
Proudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptxProudly South Africa powerpoint Thorisha.pptx
Proudly South Africa powerpoint Thorisha.pptx
 
Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17Computed Fields and api Depends in the Odoo 17
Computed Fields and api Depends in the Odoo 17
 
ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4ANG SEKTOR NG agrikultura.pptx QUARTER 4
ANG SEKTOR NG agrikultura.pptx QUARTER 4
 
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTSGRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
GRADE 4 - SUMMATIVE TEST QUARTER 4 ALL SUBJECTS
 
Keynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-designKeynote by Prof. Wurzer at Nordex about IP-design
Keynote by Prof. Wurzer at Nordex about IP-design
 
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
Visit to a blind student's school🧑‍🦯🧑‍🦯(community medicine)
 
Karra SKD Conference Presentation Revised.pptx
Karra SKD Conference Presentation Revised.pptxKarra SKD Conference Presentation Revised.pptx
Karra SKD Conference Presentation Revised.pptx
 
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptxYOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
YOUVE GOT EMAIL_FINALS_EL_DORADO_2024.pptx
 
Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...Procuring digital preservation CAN be quick and painless with our new dynamic...
Procuring digital preservation CAN be quick and painless with our new dynamic...
 

Formal Logic - Lesson 2 - Logical Connectives

  • 1. z FORMAL LOGIC Discrete Structures I FOR-IAN V. SANDOVAL
  • 3. z LEARNING OBJECTIVES ❑ Determine the truth values of an expression in propositional logic ❑ Construct truth table for logical connectives ❑ Write an expression in propositional logic in a sentence
  • 4. z PROPOSITIONAL LOGIC ❑ the area of logic that deals with propositions ❑ A formal propositional written using propositional logic notation, p, q, and r are used to represent statements. Also called as propositional variables. ❑ i.e. Proposition p ❑ “Today is Monday.” ❑ True Values refer to the attribute assigned to a proposition in respect of its truth or falsehood, which in classical logic has only two possible values. ❑ True or T ❑ False or F
  • 5. z COMPOUND PROPOSITIONS (STATEMENTS) ❑ a statement composed of two or more simple statements connected by logical connectives ❑ a simple statement could be used to build a compound statement ❑ Examples: ❑ “2 + 6 = 9” and “man is a mammal” ❑ “The ocean is blue” or “It is cold today” ❑ “Discrete Structure is not a difficult course to me”
  • 6. z COMPOUND PROPOSITIONS (STATEMENTS) ❑ a statement composed of two or more simple statements connected by logical connectives ❑ a simple statement could be used to build a compound statement ❑ Examples: ❑ “2 + 6 = 9” and “man is a mammal” ❑ “The ocean is blue” or “It is cold today” ❑ “Discrete Structure is not a difficult course to me”
  • 7. z OPERATORS / CONNECTIVES ❑ an operator or connective combines one or more operand expressions into larger expression. ❑ i.e. “+” in numeric expressions ❑ Unary operators take one operand ❑ i.e. -4 ❑ Binary operators take two operands ❑ i.e. 3 x 5 ❑ Ternary operators take three or more operands ❑ i.e. p? a:b in C and Java ❑ Propositional or Boolean Operators operate in propositions or truth values instead of on numbers.
  • 8. z LOGICAL CONNECTIVES ❑ connectives are use to create a compound proposition from two or more propositions ❑ there are six main logical connectives ❑ Negation ❑ Conjunction ❑ Disjunction ❑ Exclusive-or ❑ Conditional (Implication) ❑ Biconditional
  • 9. z LOGICAL CONNECTIVES Operator Formal Name Nickname Operand Type Symbol Negation Operator NOT Unary ¬, ∼, −, ! Conjunction Operator AND Binary ∧ Disjunction Operator OR Binary ∨ Exclusive –OR XOR Binary ⊕ Implication Operator IMPLIES Binary → Biconditional Operator “if and only if” Binary ↔
  • 10. z LOGICAL CONNECTIVES ❑ Operator precedence is an ordering of logical operators designed to allow the dropping of parentheses in logical expressions. Operator Precedence ¬ 1 ∧ 2 ∨ 3 → 4 ↔ 5
  • 11. z LOGICAL CONNECTIVES - NEGATION ❑ The negation of the statement p is written as ¬p, or sometimes ∼p, −p, !p or p where the symbol for “NOT” __ ❑ It has the property that it is false when p is true, and true when p is false ❑ The truth value of the negation of p, ¬p is the opposite of the truth value of p p ∼p T F F T ❑ The Truth Table for the Negation of a Proposition
  • 12. z LOGICAL CONNECTIVES - NEGATION ❑ Example. The following are statements for p, find the corresponding ∼p. 1. 3 + 5 = 8. 2. Sofia is a girl. 3. Laisa is not here. 3 + 5 ≠ 8. Sofia is not a girl or Sofia is a boy. Laisa is here.
  • 13. z LOGICAL CONNECTIVES - NEGATION ❑ common words associated for the Negation of a Proposition Logical Connectives Logical Expression Word Negation ¬p, ∼p, −p, !p, p’, p not p It is false that p . . . It is not the case that p . . . __
  • 14. z LOGICAL CONNECTIVES - NEGATION ❑ Example. Find the negation of the proposition “Today is Friday”. And express this in simple English. ❑ Solution. “It is not the case that today is Friday.” “It is false that today is Friday.” ❑ Simple English. “Today is not Friday.” “It is not Friday today.”
  • 15. z LOGICAL CONNECTIVES - NEGATION ❑ Example. Find the negation of the proposition “At least 10 inches of rain fell today in Miami”. And express this in simple English. ❑ Solution. “It is not the case that at least 10 inches of rain fell today in Siniloan, Laguna.” ❑ Simple English. “Less than 10 inches of rain fell today in Siniloan, Laguna.”
  • 16. z LOGICAL CONNECTIVES - NEGATION ❑ Enrichment Exercise. The following are statements for p, find the corresponding ∼p. 1. 23 is a composite number. 2. Earth has one moon. 3. Hexagon has five sides. Find the negation of p (~p) and also negation of q (~q). Let p = “It is not hot.” q = “It is sunny.”
  • 17. z LOGICAL CONNECTIVES - CONJUNCTION ❑ The conjunction of the statement p and q is the compound statement “p and q”. ❑ Symbolically, p ^ q, where ^ is the symbol for “and” ❑ It has the property that If p is true and q is true, then p ^ q is true, otherwise p ^ q is false. ❑ The Truth Table for the Conjunction of Two Propositions p q p ^ q T T T T F F F T F F F F
  • 18. z LOGICAL CONNECTIVES - CONJUNCTION ❑ Example: Determine the truth value of each of the following conjunction. ❑ 1. 2 + 6 = 9 and man is a mammal. ❑ 2. Manny Pacquiao is a boxing champion and Gloria Macapagal Arroyo is the first female Philippine President. ❑ 3. Ferdinand Marcos is the only three-term Philippine President and Joseph Estrada is the only Philippine President who resigns. Answer: False Answer: False Answer: True
  • 19. z LOGICAL CONNECTIVES - NEGATION ❑ common words associated for the Conjunction of Two Propositions Logical Connectives Logical Expression Word Conjunction p ^ q p and q p but q p also q p in addition q p moreover q
  • 20. z LOGICAL CONNECTIVES - CONJUNCTION ❑ Example: Find the conjunction of the propositions p and q where p is the proposition “Today is Friday.” and q is the proposition “It is raining today.” and the truth value of the conjunction. Solution: “Today is Friday and it is raining today.” The proposition is true on rainy Fridays.
  • 21. z LOGICAL CONNECTIVES - CONJUNCTION ❑ Example: If p = “I will have salad for lunch.” and q = “I will have steak for dinner.” p ∧ q = ? Solution: “I will have salad for lunch and I will have steak for dinner”. “I will have salad for lunch and steak for dinner.”
  • 22. z LOGICAL CONNECTIVES - CONJUNCTION ❑ Enrichment Exercise. Determine the truth values of each of the following conjunction. 1. The earth is triangle and the moon is square. 2. Square has four sides and snakes are mammals. 3. Apple is a fruit and butterflies are insects. Let p = “It is hot.” and q = “It is sunny.” Find p and q (p ∧ q)
  • 23. z LOGICAL CONNECTIVES - DISJUNCTION ❑ The disjunction of the statement p and q is the compound statement “p or q”. ❑ Symbolically, p v q, where v is the symbol for “or” ❑ It has the property that if p is true and q is true or both p and q are true, then p v q is true, otherwise p v q is false. ❑ The Truth Table for the Disjunction of Two Propositions p q p v q T T T T F T F T T F F F
  • 24. z LOGICAL CONNECTIVES - DISJUNCTION ❑ Example: Determine the truth value of each of the following disjunction. 1. 2 + 6 = 9 or Manny Pacquiao is a boxing champion. 2. Joseph Estrada is the only Philippine President who resigns or Gloria Macapagal Arroyo is the first female Philippine President. 3. Ferdinand Marcos is the only three-term Philippine President or man is a mammal. Answer: True Answer: False Answer: True
  • 25. z LOGICAL CONNECTIVES - DISJUNCTION ❑ common words associated for the Disjunction of Two Propositions Logical Connectives Logical Expression Word Disjunction p v q p or q
  • 26. z LOGICAL CONNECTIVES - DISJUNCTION ❑ Example: p = “Today is Friday.” q = “It is raining today.” p v q = ? Solution: “Today is Friday or it is raining today.” ❑ Example: p = “My car has a bad engine.” q = “My car has a bad carburetor.” p v q = “My car has a bad engine or my car has a bad carburetor.”
  • 27. z LOGICAL CONNECTIVES - DISJUNCTION ❑ Enrichment Exercises Determine the truth values of each of the following disjunction. 1. COBOL is a programming language or 2 + 5 = 7. 2. Windows 2010 is an operating system or 15 is a prime number. 3. 5 is less than 3 or 6 – 1 = 6. Answer: True Answer: True Answer: False
  • 28. z LOGICAL CONNECTIVES – EXCLUSIVE OR ❑ The exclusive-or of the statement p and q is the compound statement “p exclusive-or q”. ❑ Symbolically, p ⊕ q, where ⊕ is the symbol for “if and only if”. ❑ If p and q are true or both false, then p ⊕ q is false; if p and q have opposite truth values, then p ⊕ q is true. ❑ It can be noted that the truth values of p ⊕ q is the negation of the truth values of p ↔ q. ❑ It has nice reversibility properties (e.g. p ⊕ (p ⊕ q) always has the same truth-value as q).
  • 29. z LOGICAL CONNECTIVES – EXCLUSIVE OR ❑ The Truth Table for the Exclusive-or of Two Propositions p q p ⊕ q T T F T F T F T T F F F
  • 30. z LOGICAL CONNECTIVES – EXCLUSIVE-OR ❑ common words associated for the Exclusive-or of Two Propositions Logical Connectives Logical Expression Word Exclusive -or p ⊕ q p v q p exclusive-or q
  • 31. z LOGICAL CONNECTIVES – EXCLUSIVE OR ❑ Example p = “Today is Friday.” q = “It is raining today.” p ⊕ q: = “Today is Friday exclusive or in it’s raining “today”. The circuit is either on or off but not both. Let ab<0, then either a<0 or b<0 but not both. You may have cake or ice cream but not both.
  • 32. z LOGICAL CONNECTIVES – CONDITIONAL ❑ The conditional (or implication ) of the statement p and q is the compound statement “if p then q”. ❑ Symbolically, p → q, where → is the symbol for “if then”. ❑ p is called hypothesis (or antecedent or premise) and q is called conclusion (consequent or consequences). ❑ The conditional statement p → q is false only when p is true and q is false; otherwise p → q is true.
  • 33. z LOGICAL CONNECTIVES – CONDITIONAL ❑ The Truth Table for the Conditional of Two Propositions p q p → q T T T T F F F T T F F T
  • 34. z LOGICAL CONNECTIVES – CONDITIONAL ❑ Example: Obtain the truth values of each of the following conditional statements. 1. If vinegar is sweet, then sugar is sour. 2. 2 + 5 = 7 is a sufficient condition for 5 + 6 = 1. 3. 14 – 8 = 4 is a necessary condition that 6 ÷ 3 = 2. Answer: True Answer: False Answer: True
  • 35. z LOGICAL CONNECTIVES – CONDITIONAL ❑ common words associated for the Implications of Two Propositions Logical Connectives Logical Expression Word Conditional p → q If p, then q If p, q p is sufficient for q p implies q p only if q p therefore q p is stronger than q p is sufficient condition for q
  • 36. z LOGICAL CONNECTIVES – CONDITIONAL ❑ common words associated for the Implications of Two Propositions Logical Connectives Logical Expression Word Conditional p → q q if p q when p q follows from p q whenever p q is necessary for p q is weaker than p q is a necessary condition for p q unless ~p a sufficient condition for q is p
  • 37. z LOGICAL CONNECTIVES – CONDITIONAL ❑ Example Let p = “You study hard.” q = “You will get an excellent grade.” p → q = “If you study hard, then you will get an excellent grade.” = “You will get an excellent grade when you study hard.” If you buy air ticket in advance, it is cheaper. If it rains, the grass gets wet. If 3+3=7, then all carabaos are white.
  • 38. z LOGICAL CONNECTIVES – CONDITIONAL ❑ Other conditional statements: ❑ Converse of p → q : q → p p → q: “If it is noon, then I am hungry.” q → p: “If I am hungry, then it is noon.” ❑ Contrapositive of p → q : ~q → ~p p → q: “If it is noon, then I am hungry.” ~q → ~p: “If I am not hungry, then it is not noon.” ❑ Inverse of p → q : ~p → ~q p → q: “If it is noon, then I am hungry.” ~p → ~q: “If it is not noon, then I am not hungry.”
  • 39. z LOGICAL CONNECTIVES – BICONDITIONAL ❑ The biconditional of the statement p and q is the compound statement “p if and only if q”. ❑ Symbolically, p ↔ q, where ↔ is the symbol for “if and only if”. ❑ It has the property of if p and q are true or both false, then p ↔ q is true; if p and q have opposite truth values, then p ↔ q is false. ❑ Biconditional statements are also called bi-implications.
  • 40. z LOGICAL CONNECTIVES – BICONDITIONAL ❑ The Truth Table for the Biconditional of Two Propositions p q p ↔ q T T T T F F F T F F F T
  • 41. z LOGICAL CONNECTIVES – BICONDITIONAL ❑ Example: Determine the truth values of each of the following biconditional statements. 1. 2 + 8 = 10 if and only if 6 – 3 = 3. 2. Manila is the capital of the Philippines is equivalent to fish live in moon. 3. 8 – 2 = 5 is a necessary and sufficient for 4 + 2 = 7. Answer: True Answer: False Answer: True
  • 42. z LOGICAL CONNECTIVES – CONDITIONAL ❑ common words associated for the Biconditional of Two Propositions Logical Connectives Logical Expression Word Biconditional p ↔ q p if and only if q p is equivalent to q p is necessary and sufficient condition for q
  • 43. z LOGICAL CONNECTIVES – BICONDITIONAL ❑ Example Let p = “You can take the flight.” q = “You buy a ticket.” p ↔ q = “You can take the flight if and only if you buy a ticket.” Let p = “Pacquiao wins the senatorial election.” q = “Pacquiao will be Senate President for all.” p ↔ q = “If, and only if, Pacquiao wins the senatorial election, Pacquiao will be Senate President for all.”
  • 44. z LOGICAL CONNECTIVES – BICONDITIONAL ❑ Enrichment Exercise Determine the truth values of each of the following biconditional statements. 1. 8 + 4 = 5 if and only if 7 is less than 13. 2. 3 is a composite number is equivalent to 11 is a prime number. 3. 6 is divisible by 3 is a necessary and sufficient for 2 + 7 = 9.
  • 45. z LOGICAL CONNECTIVES ❑ For any two proposition p and q
  • 46. z • Levin, O. (2019). Discrete Mathematics: An Open Introduction 3rd Edition. Colorado: School of Mathematics Science University of Colorado. • Aslam, A. (2016). Proposition in Discrete Mathematics retrieved from https://www.slideshare.net/AdilAslam4/chapter-1- propositions-in-discrete-mathematics • Operator Precedence retrieved from http://intrologic.stanford.edu/glossary/operator_precedence.html REFERENCES