[go: up one dir, main page]
Scribd
Upload
19 views13 pages

Lecture 04 - Logics II

The document discusses the number of tuples in truth tables, which is determined by the number of propositions, calculated as 2^n. It also covers logical equivalence, providing examples and exercises to demonstrate equivalence between compound propositions, as well as the concepts of tautologies and contradictions. Additionally, it emphasizes the precedence of logical connectives in propositional logic.

Uploaded by

dreamy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views13 pages

Lecture 04 - Logics II

The document discusses the number of tuples in truth tables, which is determined by the number of propositions, calculated as 2^n. It also covers logical equivalence, providing examples and exercises to demonstrate equivalence between compound propositions, as well as the concepts of tautologies and contradictions. Additionally, it emphasizes the precedence of logical connectives in propositional logic.

Uploaded by

dreamy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Mathematical

Logic
Part II
Number of Tuples

▪ Number of Tuples(rows)in a truth table depends on the number of


propositions.

If number of propositions = n

Number of Tuples = 𝟐𝒏
Number of Tuples

Example:

If you have 2 propositions p and q

Number of Tuples = 22 = 4

If you have 3 propositions p ,q and r

Number of Tuples = 23 = 8
Truth table with three propositions

▪ We can build a proposition composing three propositions p, q, and r.


The truth table is made-up of 8 Tuples(rows).

Activity : Construct the truth table of compound proposition (p∧∼q) ∧ r


Logical Equivalence

Logical equivalence is one of the features of propositional logic.


Two propositions are said to be logically equivalent if and only if the
columns in the truth table are identical to each other.

Logically equivalent Not logically equivalent


Examples of Logical Equivalence
Draw a truth table and show compound propositions p → q and q ∨ ∼p
are equivalence.
p→q q ∨ ∼p

Equal
Therefore p → q ≡ q ∨ ∼p
Logical Equivalence Laws
Logical Equivalence Laws
Precedence of Connectives
▪ There is a precedence order for propositional connectors or logical
operators, like arithmetic operators. This order should be followed
while evaluating a propositional problem.
Exercise
Draw truth tables and show the following statement forms are logically
equivalence or not.
a) ∼ p ∨ q and p ∧ ∼ q
b) p → ∼q and ∼ q → ∼p
c) p ∨ q and ∼ p → q
d) p → ∼q and ∼ p ∨ ∼ q
e) (p ∨ q) ∨ r and p ∨ (q ∨ r)
f) (p → ∼r) ∨ q and p → (q ∨ r)
Tautologies and Contradiction

Tautologies
A proposition P is a tautology if it is true under all circumstances. It means it
contains the only T in the final column of its truth table.
Eg: (p⟶q) (∼q⟶∼p)

Tautology
Contradiction
A statement that is always false is known as a contradiction.

Eg: p ∧∼p

Contradiction
Exercise
Show that each of the following propositions is a tautology or a contradiction.

a) p → (p ∧ q )
b) (p ∨ q ) → p
c) (p ↔ q ) ∨ (p ∧ ∼ q)
d) (p → r) → (q → r)

You might also like