Teori Himpunan Dan Logika

Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 12

ALJABAR

PERNYATA AN I
T E O R I H I M P U N A N DA N L O G I K A
M AT E M AT I K A

KELOMPOK 2
The Member Of Group 2 :
• Friko Ari Ferdiantoko (171810101032)
• Alfrida Putri Puspitasari (171810101042)
• Vina Alpiani Juniar (171810101065)
ALJABAR BENTUK PERNYATAAN
• If we drew up a set up the form of statements with a coat of arms conjunctive to be obtained
new the form of statements .Conjunctive was the biggest operation of in the form of
statements , and we have an algebra that is called algebra the form of statements .The form of
statements can only have two values , namely the value of right and value wrongly .Among
others who will be worth the form of statements right is called tautology who have been
given a coat of arms U , while the always worth wrong is called contradiction given an
emblem of C.

• After laying the groundwork algebra the form of statements , maybe it was conjectures
elements that is , operations , and the relations , which are then tried to verify whether the
allegations right or wrong .Was right and were regarded have important usually appointed into
a theorem , and will be law logic which is particularly beneficial.
THEOREM 2.1
( THE NATURE OF COMMUTATIVE)
If p and q the form of statements so :

(i) p  q  q  p

(ii) p  q  q  p
THEOREM2.2
( THE NATURE OF DISTRIBUTIVE )
If p , q and r the form of statements so :

(i) p  (q  r)  (p q)  (p  r)

(ii) p  (q  r)  (p  q)  (p  r)
THEOREM 2.3
( THE NATURE OF IDENTITY)
If C, U and P the form of statements with C a contradiction and U a
tautology , so for each p applies :

(i) p  C  p

(ii) p  U  p
THEOREM 2.4
( THE NATURE OF COMPLEMENT)
If C, U , and P the form of statements with C a contradiction and U
a tautology , so for each P applies :

(i) p  ~ p  U

(ii) p  ~ p  C
THEOREM 2.5

If C, U, and P the form of statements with C a contradiction and a


tautology U, so for every P apply:

(i) p  U  U

(ii) p  C  C
Theorem is evidenced by using table value. Will evidenced by theorem 2.1 until theorem 2.4.

p  U  (p  U)  U (Theorem 2.3(ii))

 (p  U)  ( p  ~ p) (Theorem 2.4(i))

 ( p  ~ p)  (p  U) (Theorem 2.1(ii))

 p  (~p  U) (Theorem 2.2(ii))

p~p (Theorem 2.3(ii))

U (Theorem 2.4(i))

Proved theorem 2.5 (i)


p  C  (p  C)  C (Theorem 2.3(i))

 (p  C)  (p  ~p) (Theorem 2.4(ii))

 (p  ~p)  (p  C) (Theorem 2.1(i))

 p  (~p  C) (Theorem 2.2(i))

 p  ~p (Theorem 2.3( i))

C (Theorem 1.2.4(ii))

Proved theorem 2.5 (ii)


THEOREM 2.6 & THEOREM 2.7
If p, q, and r the form of statements, U a tautology and C a
contradiction, so :

Theorem 2.6
For every p apply p  p  p

Theorem 2.7
For every p apply p  p  p
THANK YOU

You might also like