Professional Documents
Culture Documents
IT 107 - Chapter 1
IT 107 - Chapter 1
▫ Conjunction [“and”]
CHAPTER 1: PROPOSITIONAL LOGIC ▫ Disjunction [“or”]
▪ Propositions, Logical Connectives and Truth
▫ Inclusive Disjunction
Tables
▪ Negation, Conjunction and Disjunction ▫ Exclusive Disjunction
▪ Conditional and Biconditional Propositions Truth Values vs Truth Table
▪ Tautologies and Contradictions ▪ Truth Value
▪ Logical Equivalence ▫ It is the assigned value to a given proposition.
▪ Arguments ▪ Truth Table
▪ Applications of Logic in Circuits
▫ It is the table which summarizes the truth values
of propositions. It displays all the possible
Introduction and Preliminaries
combinations of the given proposition, may be
Logic
▪ It is the discipline that deals with the methods of atomic or compound propositions.
▫ [Remark] There are 2n possible combinations
reasoning. It is specifically concerned with whether
of truth values to be considered in the truth
the reasoning is correct.
table.
▪ It allows us to determine the validity of an argument
that depends on its logical form, not one the How To Construct a Truth Table?
▪ [Step 1] Prepare all possible combinations of truth
particular meaning of the terms contains.
▪ Logical methods are used in mathematics to prove values for propositional variables. [This gives the
theorems in computer science to verify the total number of rows in the truth table.]
▫ The number of variables will give the initial
correctness of programs, in the natural and physical
number of columns.
sciences to draw conclusions from experiments, in
▪ [Step 2] Obtain the truth values of each connective
the social sciences and in our everyday lives to solve
and put these truth values in a new column.
a multitude of problems.
Proposition
▪ (Otherwise known as statement) is a declarative
sentence.
▫ Declarative sentences are simply statements that
relay information. It states the facts and lets the
reader know something specific. It always ends
with a period.
▪ It assigns one and only one of the two possible truth
values (or Boolean values): true (1) or false (0).
Examples:
▪ The only positive integers that divide 5 are 1 and 5
itself.
▪ The sun will come out tomorrow.
▪ a + b = b + c if a = c
▪ 5<1
▪ 10 - 1 = 9
Wrong Examples:
▪ 5-a = b
▪ What time is it?
▪ Help!
▪ Malolos is the best city in the province of Bulacan.
▪ This sentence is false. Negation
▪ Please pick up the pieces of papers. ▪ Let 𝑝 be a proposition. The statement “It’s not the
More on Propositions case that 𝑝” is called negation of 𝑝. It is denoted as
▪ In logic, statements are usually represented ¬𝑝 𝑜𝑟 ~𝑝 read as “not 𝑝”.
symbolically by the lowercase letters to represent ▫ Inserting in statement the word “not”.
propositional variables, i.e., variables that can be ▫ It is false that p.
replaced by statements. ▫ It is not the case that p.
▫ Atomic proposition – a statement that is not Remark: The symbol “~ “is called curl or tilde and is
decomposable into simple statement. used to symbolize negation (or denial or contradictory).
▫ Compound proposition – a statement formed Other symbols like “-” and “>” can also be used as
over the composition of different statements negation.
through logical connectives. Examples:
Logical Connectives ▪ 𝑝: “Today is Friday.”
▪ These are the devices used to link or join pairs of ▫ ~ 𝑝: “Today is not Friday.”
statement. ▫ ~ 𝑝: “It is not the case that today is Friday.”
▫ Negation [“not”] ▫ ~ 𝑝: “It is false that today is Friday.”
1|J e zz a mi ne
IT 107
[Sort Of Review]
▪ Compound Propositions
▫ It is a combination of propositions formed from
existing propositions using logical connectives. Inclusive Disjunction Examples:
▫ Propositional Connectives ▪ 𝑝: “Plaridel is the capital of Bulacan.”
▫ It is an operation that combines two ▪ 𝑞: “Malolos is one of the cities found in Region III.”
propositions to yield a new one whose truth ▪ 𝑝 ∨ 𝑞: “Plaridel is the capital of Bulacan or
value depends only on the truth values of the Malolos is one of the cities found in Region III.”
two original propositions. ▪ 𝑝: “3 is an even number.”
Conjunction ▪ 𝑞: “A century is 100 years.”
▪ Let 𝑝 and 𝑞 be propositions. The propositions “𝑝 and ▪ 𝑝 ∨ 𝑞: “3 is an even number, or a century is 100
𝑞” is denoted by 𝑝 ∧ 𝑞. This is also read as “the years.”
conjunction of 𝑝 and 𝑞”. The conjunction “𝑝 ^ 𝑞” is
true if both 𝑝 and 𝑞 are true.
NOTE:
▪ “but” has the same logical meaning as “and”
▪ Other words used to conjoin two propositions.
▫ moreover, furthermore, yet, still, however, also,
nevertheless, although, and so forth, comma (,)
and colon (:) are also used to conjoin two
propositions
2|J e zz a mi ne
IT 107
3|J e zz a mi ne
IT 107
Biconditional Propositions
▪ If p and q are propositions, the compound
proposition “p if and only if q” is called a
biconditional proposition and is written p↔q.
▪ The connective “p if and only if q” is the
conjunction of p → q and its converse q → p,
the truth value of proposition p↔ q is defined by the
truth table below.
NOTE:
▪ 𝑝↔𝑞 is equivalent to the following expressions:
▫ 𝑝 is equivalent to 𝑞, 𝑝 if and only if 𝑞, 𝑝 is
necessary and sufficient for 𝑞, if 𝑝 then 𝑞 and
conversely
Examples:
▪ 𝑝: “David is the son of Ricky.”
▪ 𝑞: “Ricky is the father of David.”
▪ 𝑝↔𝑞: “David is the son of Ricky if and only if
Ricky is the father of David.”
▪ 𝑝: “12 is divisible by 2.”
▪ 𝑞: “12 is even.”
▪ 𝑝↔𝑞: “12 is divisible by 2 if and only if 12 is
even.”
Note on Biconditional Proposition
▪ 𝑝↔𝑞 is true when both 𝑝 𝑎𝑛𝑑 𝑞 has the same logical
truth value
EXAMPLE
𝑝: “7 > 12” F
𝑞: “7 is even” F
4|J e zz a mi ne