Scribd
Upload
482 views32 pages

Logic and Proposition

The document discusses propositional logic and calculus. It defines key concepts like propositions, compound propositions, negation, disjunction, and conjunction. Negation of a proposition p is written as ¬p and means "it is not the case that p". Disjunction of propositions p and q is written as p ∨ q and means "p or q". Conjunction is written as p ∧ q and means "p and q". Truth tables are used to determine the truth values of compound propositions based on the truth values of the individual propositions. Conditional and biconditional statements are also introduced.

Uploaded by

Jayson Pantoja Natividad
Copyright
© Attribution Non-Commercial (BY-NC)
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
482 views32 pages

Logic and Proposition

The document discusses propositional logic and calculus. It defines key concepts like propositions, compound propositions, negation, disjunction, and conjunction. Negation of a proposition p is written as ¬p and means "it is not the case that p". Disjunction of propositions p and q is written as p ∨ q and means "p or q". Conjunction is written as p ∧ q and means "p and q". Truth tables are used to determine the truth values of compound propositions based on the truth values of the individual propositions. Conditional and biconditional statements are also introduced.

Uploaded by

Jayson Pantoja Natividad
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 32

Logic and Propositional Calculus

Engr. Francis A. Malabanan


ECE, Instructor

A proposition (or statement) is a declarative statement which is true or false, but not both.
i.

ii.
iii. iv. v. vi.

Ice floats in water. China is in Europe. 2+2=4 2+2=5 Where are you going? Do your homework.

Many propositions are composite, that is, composed of subpropositions and various connectives discussed subsequently. Such composite propositions are called compound propositions. A proposition is said to be primitive if it cannot be broken down into simpler propositions, that is, if it is not composite.

Primitive proposition:

Ice floats in water. China is in Europe. 2+2=4 2+2=5

Compound proposition:
Roses are red and violets are blue. John is smart or he studies every night.

3 Basic logical operations Negation, p Disjunction, p q Conjunction, p q

Let p be a proposition. The negation of p, denoted by p (also denoted by p), is the statement It is not the case that p. The proposition p is read not p. The truth value of the negation of p, p, is the opposite of the truth value of p.

If p is true, then p is false; and if p is false, then p is true.

a1) Ice floats in water. a2) It is false that ice floats in water. a3) Ice does not float in water. b1) 2 + 2 =5 b1) It is false that 2 + 2 = 5. b1) 2 + 2 5

If p and q are false, then p q is false; otherwise p q is true.

Any two propositions can be combined by the word or to form a compound proposition called the disjunction of the original propositions. Symbolically, pq The proposition p q is read p or q, denotes the disjunction of p and q.

Ice floats in water or 2 + 2 = 4.


China is in Europe or 2 + 2 = 4.

Ice floats in water or 2 + 2 = 5.


China is in Europe or 2 + 2 = 5.

Any two propositions can be combined by the word and to form a compound proposition called the conjunction of the original propositions. Symbolically, pq The proposition p q is read p and q, denotes the disjunction of p and q.

If p and q are true, then p q is true; otherwise p q is false.

Ice floats in water and 2 + 2 = 4.


China is in Europe and 2 + 2 = 4.

Ice floats in water and 2 + 2 = 5.


China is in Europe and 2 + 2 = 5.

Let P(p, q, . . .) denote an expression constructed from logical variables p, q, . . ., which take on the value TRUE (T) or FALSE (F), and the logical connectives , , and . Such an expression P(p, q, . . .) will be called a proposition.

The actual truth table of the proposition (p q)

Remarks: In order to avoid an excessive number of parentheses, we sometimes adopt an order of precedence for the logical connectives. Specifically, has precedence over which has precedence over
not (p q)

For example: p q means (p) q

and

j p q p j q
1 2

Simply:

( j p ) ( q ( p )) ( j ( q ))

indicates how the truth table of (p q) is constructed

Note: For 2 variables, as above, 4 rows are necessary; for 3 variables, 8 rows are necessary; and, in general, for n variables, 2n rows are required.

For three proposition j, p, and q we have 23 combinations (8)


1 2 3 4 5 6 7 8
j T T T T F F F F p T T F F T T F F q T F T F T F T F

(jpq)
F F F T F T F T

Use the laws to show that (p q) (p q) p Statement Reason


(p q) (p q) p (q q) p T p (p q) (p q)

1. 2. 3. 4.

Let p and q be propositions. The conditional statement p q is the proposition if p, then q. The conditional statement p q is false when p is true and q is false, and true otherwise.

Let p and q be propositions. The biconditional statement p q is the proposition p if and only if q. The biconditional statement p q is true when p and q have the same truth values, and is false otherwise.

Prepared by: Engr. Francis A. Malabanan ECE, Instructor First Asia Institute of Technology and Humanities

You might also like