Scribd
Upload
6 views16 pages

Proposition 2

Propositional logic deals with statements that can be assigned true or false values. A proposition is a statement with a true or false value. Logical connectives like negation, conjunction, disjunction, implication, and biconditional can combine propositions into compound statements. Truth tables map out the possible truth values of expressions to determine outcomes.

Uploaded by

Ja-Cy R4o15se04ro
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
6 views16 pages

Proposition 2

Propositional logic deals with statements that can be assigned true or false values. A proposition is a statement with a true or false value. Logical connectives like negation, conjunction, disjunction, implication, and biconditional can combine propositions into compound statements. Truth tables map out the possible truth values of expressions to determine outcomes.

Uploaded by

Ja-Cy R4o15se04ro
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/ 16

Propositional

Logic
Prepared by: Clarize Styles
Propositional logic

Propositional logic is concerned


with statements to which the truth
values, “true” and “false”, can be
assigned. The purpose is to analyze
these statements either individually
or in a composite manner.
Proposition

A proposition is a collection of
declarative statements that has
either a truth value “true” or a
truth value “false”.
1. Philippines is a country. Proposition
2. What is your name? Not Proposition
3. It rained Yesterday. Proposition
4. Find a number which divides your
age. Not Proposition
5. Welcome to the Philippines! Not Proposition
Logical connectives &
compound statements

Propositional Variables
are propositions usually denoted as p, q,
r,…etc., Propositional variables can be
combined using logical connectives to
obtain compound statements.
The five logical connectives are:

~ or ¬ or ‘
Basic logical operations
1. Negation: It means the opposite of the original statement. If
p is a statement, then the negation of p is denoted by ~p and
read as 'it is not the case that p.' So, if p is true then ~ p is false
and vice versa.
Example: If statement p is Paris is in France, then ~ p is 'Paris
is not in France'.
2. Conjunction: It means and’ing of two statements. If p, q are
two statements, then "p and q" is a compound statement,
denoted by p ∧ q and referred as the conjunction of p and q.
The conjunction of p and q is true only when both p and q are
true. Otherwise, it is false.
3. Disjunction: It means Or’ing of two statements. If p, q are two
statements, then "p or q" is a compound statement, denoted by
p ∨ q and referred to as the disjunction of p and q. The
disjunction of p and q is true whenever at least one of the two
statements is true, and it is false only when both p and q are
false.
4. Implication / if-then (⟶): An implication p⟶q is the
proposition "if p, then q." It is false if p is true and q is false.
The rest cases are true.

T
5. If and Only If (↔): p ↔ q is bi-conditional logical connective
which is true when p and q are same, i.e., both are false or both
are true.
Truth Tables
A truth table provides a method for mapping out
the possible truth values in an expression and to
determine their outcomes. The table includes a
column for each variable in the expression and a
row for each possible combination of truth values. It
also includes a column that shows the outcome of
each set of values.
Tautology &
contradiction
Tautology is used to apply in the propositional
formula, which may be true or false regardless of
false or truth of their given propositional
variables. In Boolean algebra, a tautology is a
formula that is always true in each and every
possible condition.
Example #1: Is ¬b →b a tautology statement?
b ¬b ¬b → b
T F T
F T F

Solution: No; the truth values of ¬b →b are {T,F}.


Example #2: Is [(p→q)∧p]→p a tautology statement?
p q p→q (p→q) ∧ p [(p→q)∧p] → p
T T T T T
T F F F T
F T F F T
F F T F T
Solution: Yes; the truth values of [(p→q)∧p]→p are
{T,T,T,T}.
Thank
You

You might also like