Scribd
Upload
135 views24 pages

Logic and Propositions

The document discusses the basics of propositional logic including definitions, examples, logical connectives, and truth tables. It defines logic as the study of evaluating arguments and reasoning. Propositional logic uses propositional variables (p, q, r) to represent statements that can be either true or false. Logical connectives like conjunction, disjunction, negation are used to combine simple propositions into compound propositions. Truth tables are used to determine the truth values of compound propositions for all combinations of truth values of the component simple propositions. The document also discusses tautologies, contradictions and contingencies based on whether the compound proposition is always true, always false or can be either true or false.

Uploaded by

Noreen Jade Quebrado Lozano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
135 views24 pages

Logic and Propositions

The document discusses the basics of propositional logic including definitions, examples, logical connectives, and truth tables. It defines logic as the study of evaluating arguments and reasoning. Propositional logic uses propositional variables (p, q, r) to represent statements that can be either true or false. Logical connectives like conjunction, disjunction, negation are used to combine simple propositions into compound propositions. Truth tables are used to determine the truth values of compound propositions for all combinations of truth values of the component simple propositions. The document also discusses tautologies, contradictions and contingencies based on whether the compound proposition is always true, always false or can be either true or false.

Uploaded by

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

LOGIC

WHAT IS LOGIC?

• The term “logic” is often used, but


not always in its technical sense

• Logic is technically defined as “the


science or study of how to evaluate
arguments and reasoning.
MATHEMATICAL LOGIC (SYMBOLIC LOGIC

• A branch of mathematics with close


connections with computer science.

• Includes both the mathematical study of


logic and the applications of formal logic
to other areas of mathematics.
PROPOSITION (STATEMENT)

• Is a declarative sentence with is either


true or false, but not both.

• The truth value of the propositions is the


truth and falsity of the proposition.
EXAMPLE

Determine whether if it's a proposition or not.

A. Manila is the Capital of the Philippines.

B. What day is it?

C. Help me, please.

D. He is handsome.
TERMS

Propositional Variable - used to represent a


proposition.
Propositional Logic Notations - p, q, and r are
use to represent propositions.
Compound proposition - a proposition
composed of two or more simple
proposition connected by logical
connectives ("and”, “or”, “if then", "not", "if
and only if”, “exclusive or”).
Proposition which is not compound is said to be
“simple" (also called atomic).
OPERATIONS ON PROPOSITION

• There are three main logical connectives


such conjunction, disjunction, and
negation.

• Note that T refers to true proposition and


F refers to false proposition.
CONJUNCTION

Conjunction if p is true and q is true, then p Λ q is


true; otherwise p Λ q is false. Meaning, the
conjunction if two propositions is true only if each
proposition is true.

It uses the word “and” and the symbol “Λ”


DISJUNCTION

Disjunction. if p is true or q is true or if p and q


are true, then p V q is true; otherwise p V q is false.
Meaning, the disjunction of two proposition is false only if
each proposition is false.

It uses the word “or” and the symbol is "V"


NEGATION

Negation. If p is true. ~p is false. Meaning, the truth


value of the negation of a proposition is always
the reverse of the truth value of the original
proposition.

It uses the word "not" and the symbol is “~”


CONDITIONAL

The conditional proposition p → q is false only when p is


true and q is false; otherwise p → q is true.
Meaning p → q states that a true proposition
cannot imply a false proposition

It uses the word “if p then q” and the symbol “→”


BICONDITIONAL

If p and q are true or both false then p ↔ is true, if p and


q have opposite truth values then p ↔ q is false.

It uses the word “if and only if” and the symbol “↔”
EXCLUSIVE-OR

If p and q are true or both false, then p ⊕ q is false; if p


and q have opposite truth values, then p ⊕ q is true.

It uses the word “exclusive-or” and the symbol “⊕”


logical connectives logical expressions word
p and q
p but q
Conjunction pΛq p also q
p in addition q
p moreover q
Disjunction pvq p or q
not p
it is false that p..
Negation ~p
it is not the case that
p..
if p then q
p implies q
Conditional p→q p only if q
p therefore q
p is stronger than q
p if and only q
Biconditional p↔
p is equivalent to q
Exclusive-or p⊕q p exclusive-or q
TRUTH TABLES

This section shows the construction of


compound propositions through truth tables which
referred as standard truth table form.
a. ~p V ~q

p q ~p ~q ~p V ~q

T T F F F

T F F T T

F T F T T

F F T F T
b. p → (p ↔ ~q)
p q ~p p ↔ ~q p → (p ↔ ~q)

T T F F F

T F F T T

F T F T T

F F T F T
c. (~p Λ q) v (p Λ ~q)

p q ~p ~p λ q ~q p λ ~q (~p Λ q) v (p Λ ~q)

T T F F F F F

T F F F T T T

F T F T F F T

F F T F T T F
d. (p → q) v (q Λ ~r)

p q r p→ q ~r q Λ ~r (p → q) v (q Λ ~r)

T T T T F F T

T T F T T T T

T F T F F F F

T F F F T F F

F T T T F F T

F T F T F F T

F F T T F F T

F F F T T F T
TAUTOLOGIES

There are 3 important classes of compound


statements namely Tautology, contradiction and
contingency.

Tautology is a compound statement that is true


for all possible combinations of the truth values of the
propositional variables also called logically true.
TAUTOLOGIES
Contradiction is a compound statement that is
false for all possible combinations of the truth values of
its propositional variables also called logically false or
absurdity.

Contingency is a compound statement that


can either be true or false, depending on the truth
values of the propositional variables are neither a
tautology nor a contradiction.
a. (~p Λ q) → q

p q ~p ~p Λ q (~p Λ q) → q

T T F F T

T F F F T

F T T T T

F F T F T

Since all the truth values of the compound


(~p Λ q) → q are true, thus it is a tautology
b. (p → q) Λ (p → ~q)

p q p→q ~q p → ~q (p → q) Λ (p → ~q)

T T T F F F

T F F T T F

F T T F T T

F F T T T T

Note that the truth values of the statement


(p → q) Λ (p → ~q) are combinations of true and
false, therefore the compound statement is a
contingency
c. (~p V q) ⊕ (p → q)

p q ~p ~p V q p→q (~p v q) ⊕ (p → q)

T T F T T F

T F F F F F

F T T T T F

F F T F T F

Observe that the truth values of the


compound statement are false, thus it is a
contradiction

You might also like