Scribd
Upload
2 views

logic.converse

The document explains logical connectives, particularly focusing on conditional propositions and their forms: converse, inverse, and contrapositive. It also discusses tautology, contradiction, and contingency in compound propositions, providing examples and truth tables for clarity. Additionally, it covers quantifiers and their negations, illustrating universal and existential statements with examples.

Uploaded by

Angel mondero
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

logic.converse

The document explains logical connectives, particularly focusing on conditional propositions and their forms: converse, inverse, and contrapositive. It also discusses tautology, contradiction, and contingency in compound propositions, providing examples and truth tables for clarity. Additionally, it covers quantifiers and their negations, illustrating universal and existential statements with examples.

Uploaded by

Angel mondero
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Logical Connectives are define by Truth Table but have English counterparts.

Review: Conditional Propositions

Conditional If … , → p→q If p, p → q is FALSE when p (antecedent) is


then … . then q TRUE and q (consequent) is FALSE,
otherwise it is TRUE

Antecedent or Hypothesis – an event or cause coming before something.

Consequent or Conclusion – following s a result or effect

Converse, Inverse, and Contrapositive


Read the following conditional statement : “ If it is raining, then Saraus has his umbrella up.” Write the
converse, inverse and contrapositive statement.

So our p: It is raining. (Antecedent or Hypothesis)

q: Saraus has his umbrella up.(Consequent or Conclusion)

Connective we used was If…p, then q…. statement or conditional statement.

Key Definition Example


words
Converse If q , then Is formed by If Saraus has his umbrella up,
p. interchanging the then It is raining.
position of its
antecedent and
consequent.
Inverse If not p, Is formed by negating If it is not raining, then Saraus
then q. the antecedent and does not his umbrella up.
consequent.
Contrapositive If not q, Formed by getting the If Saraus does not his umbrella
then not inverse of converse. up, then It is not raining.
p
Example: If you study wisely, then you can answer the activities.

Converse: If you can answer the activities, then you study wisely.

Inverse: If you don’t study wisely, then you can’t answer the activities.

Contrapositive: if you can’t answer the activities, then you don’t study wisely.

Tautology, Contradiction, and Contingency.


 A proposition is Satisfiable if it is true at least once.
 A compound proposition is Tautology if it is true for all truth value assignment of the involved
simple proposition. A tautology is a valid proposition.
 A compound proposition is a Contradiction if it false for all truth value assignment of the involve
simple proposition.
 A contingency is neither a tautology nor a contradiction.

Example. Which of the following compound proposition is Tautology, Contradiction, and Contingency.

1. ( p q ) → ( p ∨∼ q )

p q p ∧q ( p ∧q ) p q p ∨∼ q ( p ∧q ) → ( p∨ ∼q )
T T T F F F F T
T F F T F T T T
F T F T T F T T
F F F T T T T T

Since the last column are consist of TRUE, Therefore the given compound proposition is TAUTOLOGY.

2. ∼ p → [ q → ( p ⋀ q ) ]

p q ∼p p ⋀q q→( p⋀ q) ∼ p →[ q →( p ⋀ q ) ]

T T F T T T
T F F F T T
F T T F F F
F F T F T T
Since the last column are consist of TRUE and FALSE, Therefore the given compound proposition is
CONTINGENCY.

3. ( p ⋁ q ) ⋀ [ ( ∼ p ⋀ ∼ q ) ]

p q p ⋁q ∼p ∼q ∼ p ⋀∼q ( p ⋁ q ) ⋀ [(∼ p ⋀ ∼q )]

T T T F F F F
T F T F T F F
F T T T F F F
F F F T T T F

Since the last column are consist of TRUE, Therefore the given compound proposition is CONTRADICTION.

Quantifiers and Negation


Quantifier Symbol Read as
Universal or General ∀ For all, all, every
Quantifier ‘ every element satisfied’
Existential Quantifier ∃ There exist and at least one
‘ to emphasize the existence
of something’

none and no
‘ deny the existence of
something’

Important Kind of Mathematical Statements.

Universal – a certain property is true for all elements in a set.

Example. All positive numbers are greater than zero.

Existential – given a property that may or may not be true, there is at least one thing for.
Quantified statement Negation
No Y are Z Some Y are Z
ex. No students are wearing their uniform. ex. Some students are wearing their
uniform.
Some Y are Z No Y are Z
ex. Some students are wearing their ex. No students are wearing their uniform.
uniform.
Some Y are not Z All Y are Z
ex. Some school gate are not open (or ex. All school gate are open.
close).
All Y are Z Some Y are not Z.
ex. All school gate are open. ex. Some school gate are not open (or
close).

EXAMPLES.

All boys are cheater. Some boys are not cheater.


Some boys are not cheater. All boys are cheater.
No woman are beautiful. Some woman are beautiful.
Some woman are beautiful. No woman are beautiful.

You might also like