0% found this document useful (0 votes)
0 views

13. Propositional Logic

The document provides an introduction to propositional logic, defining key concepts such as propositions, truth values, and logical connectives. It explains different types of logical connectives including negation, conjunction, disjunction, implication, and biconditional, along with examples of their usage. Additionally, it includes exercises for translating statements into logical notation and vice versa.

Uploaded by

yapelija
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
0 views

13. Propositional Logic

The document provides an introduction to propositional logic, defining key concepts such as propositions, truth values, and logical connectives. It explains different types of logical connectives including negation, conjunction, disjunction, implication, and biconditional, along with examples of their usage. Additionally, it includes exercises for translating statements into logical notation and vice versa.

Uploaded by

yapelija
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Propositional Logic

Objectives
• Understand logic and propositions
• Determine the different types of logical
connectives
• Changing Symbols to Sentence Form of Logical
Connectives
Introduction to Logic

Proposition - A proposition is a declarative sentence


that is either true or false but can never be both.

It is usually represented by the small letters p, q, r, and s.

Truth Value – the value of the proposition that can be


either True or False.
Introduction to Logic
Consider the following statements. Identify if they are propositions or not.
If yes, determine their truth value.
1. p = Davao City is the largest city in the Philippines.
2. q = Dolphins are mammals.
3. r = Is it raining?
4. s = Clean your room.
5. t = 6 is a prime number.
6. u = You have a nice car.
7. v = This proposition is false.
Logical Connectives
A logical connective is a word or symbol used to connect two
propositions to produce grammatically valid compound propositions.

Simple proposition – a statement that conveys a single idea.


p = Joshua likes to play video games.
q = Joshua always stays up late.

Compound proposition – a statement that conveys two or more ideas.


Joshua likes to play video games and always stays up late.
Logical Connectives
1. Negation – read as “not” and has a symbol ~.

Consider the following propositions:


p = Today is Sunday.
q = The shop is closed
~p = Today is not Sunday.
~q = The shop is not closed.
Logical Connectives
2. Conjunction – read as “and” and has a symbol ∧.

Consider the following propositions:


p = Today is Sunday.
q = The shop is closed
p ∧ q = Today is Sunday and the shop is closed.
Logical Connectives
3. Disjunction – read as “or” and has a symbol ∨.

Consider the following propositions:


p = Today is Sunday.
q = The shop is closed
p ∨ q = Today is Sunday or the shop is closed.
Logical Connectives
4. Implication – read as “If … then …” and has a
symbol →.

Consider the following propositions:


p = Today is Sunday.
q = The shop is closed
p → q = If today is Sunday then the shop is closed.
Logical Connectives
5. Biconditional – read as “If and only if” and has a
symbol .

Consider the following propositions:


p = Today is Sunday.
q = The shop is closed
p q = Today is Sunday if and only if the shop is closed.
Logical Connectives
Symbolic
Connective Symbols Read as
Form
Negation ∼ Not p ∼p
Conjunction ⋀ p and q p^q
Disjunction ⋁ p or q pvq
Implication → If p, then q p→q

Biconditional p if and only if q p q


Example
Represent the following statements using logical connectives.

a) P or not Q. 𝐏 ∨∼𝑸

b) If P and R, then Q. (𝐏 ∧ 𝑹) → 𝑸

c) P if and only if (Q and R). 𝑷 (𝑸 ∧ 𝑹 )

d) Not P and not Q. ∼ 𝐏 ∧ ∼ 𝑸

e) It is not the case that if P, then Q. ∼ (𝐏 → 𝑸)

f) If P and Q, then R or S. 𝐏 ∧ 𝑸 → (𝑹 ∨ 𝑺)
Example
Translate the following statements into logical notation, using the following
symbols:
p = "The taco is hot."
q = "The lasagna is cold."
r = "The pizza will be delivered."
(a) "The taco is hot and the pizza will not be delivered."
(b) "If the lasagna is cold, then the pizza will be delivered."
(c) "Either the lasagna is cold or the pizza won't be delivered."
(d) "If the pizza won't be delivered, then both the taco is hot and the lasagna is
cold."
Example
Translate the following statements into logical notation, using the
following symbols:
p = "The taco is hot."
q = "The lasagna is cold."
r = "The pizza will be delivered."
(e) "The lasagna isn't cold if and only if the taco isn't hot."
(f) "The pizza will be delivered only if the lasagna is cold."
(g) "The taco is hot and the lasagna isn't cold, but the pizza will be
delivered."
Example
Given Express the following symbols
to sentences.
p : Joy watched the concert of Ben&Ben.
1. ~p
q : Joy studies for the test.
2. p ^ q
r : Joy is fully rested.
3. q v r
s : Joy passed the test.
4. ~q
5. q → s
6. s (q ^ r)
7. (~p ^r) → (q ^ s)

You might also like