0% found this document useful (0 votes)
92 views8 pages

Truth Table DLP

This document is a detailed lesson plan for a General Mathematics class focusing on simple and compound propositions, including their definitions, distinctions, and operations. The lesson includes preliminary activities, a motivational game, and structured discussions on propositional logic, logical connectives, and truth tables. It also outlines evaluation methods and assignments for students to reinforce their understanding of the topic.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
92 views8 pages

Truth Table DLP

This document is a detailed lesson plan for a General Mathematics class focusing on simple and compound propositions, including their definitions, distinctions, and operations. The lesson includes preliminary activities, a motivational game, and structured discussions on propositional logic, logical connectives, and truth tables. It also outlines evaluation methods and assignments for students to reinforce their understanding of the topic.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Our Lady of Lourdes College

5031 Gen. T de Leon, Valenzuela City

DETAILED LESSON PLAN IN


GENERAL MATHEMATICS 11
School Year 2024-2025
Date: November 2024
Grade: 11
Subject: General Mathematics
I. OBJECTIVES
At the end of 1 hour and 45 minutes, the learners are expected to:
a. Define simple and compound propositions;
b. Distinguish simple and compound propositions; and
c. Construct a truth table and perform operations on proposition.

II. SUBJECT MATTER


TOPIC: Simple and Compound Proposition; Operations on Propoaitions
REFERENCES: General Mathematics Quarter 2: Module 6
Instructional Materials: Visual Aids

III. LEARNING PROCEDURES

Teacher’s Response Student’s Response


A. Preliminary Activities

Good morning class, Good morning, Ma’am Vargas.

Let us pray first. Ms./Mr. kindly lead the Selected student will lead the prayer
prayer.

Students will pick up the litters around them


Before taking your seats, kindly pick up those and will arrange their chairs.
litters that you see around you and arrange the
chairs properly.

The class secretary will tell the names of the


Who is absent today, Ms. Secretary? absentees.

Okay, thank you.

B. Motivation
So, before we start with our agenda today. We
will first have a game to warm up your brains.
We will be having two groups only, the student
in the right will be the group one and the other
side will be the group 2.

I will flash statements and you will identify the


connectives and then the type of statement.

 I will eat breakfast, and then I’ll go for a run. Conjunction: and

 Either we finish the project today, or we Disjunction: or


continue tomorrow.

 If it rains, then the match will be canceled. Conditional: If…then

 You will succeed if and only if you work Biconditional: if and only if
hard
Disjunction: or
They will come to the party, or they’ll stay
home

Congratulations on the winning group. Winning groups may vary.


Thank you for everyone’s participation.
C. Lesson Proper

Now, we will be discussing a new topic about


Propositional Logic.
Lesson 3: Simple and Compound
Proposition

Kindly read, what is simple proposition?

Simple Proposition
A proposition that conveys one thought with no A proposition that conveys one thought with
connecting words. It cannot be broken down no connecting words. It cannot be broken
any further into other component propositions. down any further into other component
propositions
Next, we have compound proposition.

Compound Proposition
A proposition formed from simpler proposition A proposition formed from simpler
using logical connectors. It contains two or proposition using logical connectors. It
more simple proposition that are put together contains two or more simple proposition that
using connective words. are put together using connective words.

Simple Proposition: “Logic is fun”


Compound Proposition: “Logic is fun and logic
is interesting”.
To be able to form compound propositions, we
use basic logical connectives.

Who can recall our connectives or the type of Negation, disjunction, conjuction,
statements we used in our discussion last conditional, and biconditional.
meeting? We have?

Okay,
 Not p (negation)
 p or q (disjunction)
 p and q (conjuction)
 if p, then q (conditional)
 if and only if (biconditional)

Example:
Proposition Simple Compound
Components Proposition
p1 p: Today is Today is not
Monday Monday The students will read and analyze the
p2 q: You study If you study examples.
hard hard, then
r: You get you get good  Today is not Monday (not p)
good grades grades.  If you study hard, then you get good
p3 s: I will pass If I will pass grades (if q, then r)
the exam. the exam,  If I will pass the exam, then I will be
t: I will be then I will be promoted (if s, then t)
promoted promoted.  Cristina loves her daughter and Kelly
p4 u: Cristina Cristina loves her mother (u and v)
loves her loves her
daughter daughter and
v: Kelly Kelly loves
loves her her mother.
mother

Any questions or clarification? None, ma’am.

Now, let’s proceed to the operations on


proposition.

Lesson 4: Operations on Propositions

Different combinations of compound


propositions can be formed by using logical
connectives or simply, connectives. Words such
as and, or, not, and if…then are examples of
connectives.

Please read the following.

Logical Connectors
A. Conjunction – two simple proposition
connected using the word and. Conjunction – two simple proposition
connected using the word and.
B. Disjunction – two simple proposition
connected using the word or. Disjunction – two simple proposition
connected using the word or.
C. Conditional – two simple proposition
that are connected using the words if… Conditional – two simple proposition that are
then. connected using the words if…then.

D. Biconditional – conjunction of two


conditional statements where the Biconditional – conjunction of two
antecedent and consequent of the first conditional statements where the antecedent
statement have been switched in the and consequent of the first statement have
second statement. been switched in the second statement.

E. Negation – the negation of a given


statement is a statement that is false Negation – the negation of a given statement
whenever the given statement is true is a statement that is false whenever the given
and true when the statement is false. statement is true and true when the statement
is false.
Again, these are the logical connectors that
we’ve discussed last meeting.

Definition 1:
The conjunction of the proposition p, q is the
compound proposition “p and q”. The conjunction of the proposition p, q is the
compound proposition “p and q”.
p q ∧
p q
T T T
T F F
F T F
F F F

Okay, so In a truth table for conjunction (using


the connective and), the statement is true only
if both individual propositions are true. If either
or both propositions are false, the conjunction
as a whole is false.

So if p is true and q is also true, what is p and


q? True or T, ma’am.

Very good.

Definition 2:
The disjunction of the proposition p, q is the
compound proposition “p or q”. The disjunction of the proposition p, q is the
compound proposition “p or q”.
p q pvq
T T T
T F T
F T T
F F F

So if p is false and q is true, what is p or q?


True or T, ma’am.
Okay, that’s correct. What if both are F?
False or F, ma’am.
Very good.
Definition 3:
The negation of the proposition p is denoted as
p (the symbol for not) The negation of the proposition p is denoted
as p (the symbol for not)
p p
T F
F T

If p is T, what is the negation of p?


False or F, ma’am.
Very good.

Definition 4:
The conditional (implication) of the proposition
p and q is the compound proposition “if p, then The conditional (implication) of the
q) proposition p and q is the compound
proposition “if p, then q)
p q p→ q
T T T
T F F
F T T
F F T

So, if p is F and q is T, what is, if p then q?


True or T, ma’am.
Very good. So, in a truth table for conditional
(using the connective if...then), the statement is
false only when the first proposition (the
antecedent) is true and the second proposition
(the consequent) is false. In all other cases, the
conditional statement is true.

Definition 5:
The biconditional of the proposition p and q is The biconditional of the proposition p and q
the compound proposition “p if and only if”. is the compound proposition “p if and only
if”.
p q p↔q
T T T
T F F
F T F
F F T

If p is F and q is T or vice versa, the


biconditional is? False or F, ma’am.

If both are false?


True or T, ma’am.
Very Good. Did everyone understand our topic
today? Yes ma’am.
D. Generalization

Okay now to measure your takeaways from


today’s discussion, I will ask you some
questions.

1. What is a simple proposition? Simple proposition is a proposition that


conveys one thought with no connecting
words. It cannot be broken down any further
into other component propositions.

2. What is a compound proposition? Compound proposition is a proposition


formed from simpler proposition using
logical connectors. It contains two or more
simple proposition that are put together using
connective words.

3. What is the logical connective The negation of a given statement is a


“Negation”? statement that is false whenever the given
statement is true and true when the statement
is false.

4. What is the type of statement where we When we used the connective ‘and’, the type
used the connective ‘or’? of statement is Disjunction.

Very Good, class. It seems that you’ve learned


a lot today.
1. Application
Now for your activity, you will be group into 5. The groups will be formed by head counts.

Procedure:
 Construct five simple proposition and
five compound proposition
 Classify each compound proposition as Each group will have a representative to
a negation, conjunction, disjunction, present their works.
conditional, or biconditional.
 Present your work in the class.
 Each group will be graded using the
rubric.

Criteria 4 3 2
Construction Constructs Constructs Constructs
of Simple clear, correct mostly clear propositions
and simple and and correct with Scores may vary.
Compound compound propositions, some
Propositions propositions with minor noticeable
with no structural or errors or
errors in grammatical unclear
grammar or errors. meaning
structure
Identification Accurately Mostly Some
of identifies accurate in correct
Connectives connectives identifying identification
and and correctly connectives of
Classification classifies all and connectives
of Propositions propositions classifying and
as simple or propositions, classifications,
compound. with minor but
errors. several errors
are present.
IV. Evaluation
Get one-half crosswise and answer the
following.

Direction:

I. Write "Simple" if the statement is a


simple proposition, and
"Compound" if it is a compound
proposition.

1. The sun rises in the east. 1. Simple


2. I will study for the test or go to the 2. Compound
game.
3. Birds can fly, and fish can swim. 3. Compound
4. If it rains, the picnic will be canceled. 4. Compound
5. Water boils at 100 degrees Celsius. 5. Simple
6. She finished her homework and went to 6. Compound
bed early.
7. Dogs are loyal animals. 7. Simple
8. Either John will attend the meeting, or 8. Compound
Sarah will go.
9. My phone is charging. 9. Simple

10. We will go to the beach if the weather


is nice. 10. Compound

II. Complete the table.

p q p∧q pvq p q p∧q pvq


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

V. Assignment
For your assignment construct truth table
showing all the operations on proposition.

Logical Connectors

A. Conjunction
B. Disjunction
C. Conditional
D. Biconditional
E. Negation

Any questions? None ma’am.

That would be all for today. Students: Goodbye and thank you, ma’am
Goodbye class. See you again next meeting. Vargas.

Prepared by:
Kim Nicole Vargas

You might also like