oct.tl/2Dl7Lawsoflog=@

.

Collection of all"

statements"

• ,

" proposition"

⇐My dog is stupid

"

-can be true

on flase

ng, q= " My cat is mean "÷9. r . . . propositions

A andPr 9 = My dog is stupid

and

my cat is mean .

v or

~ negation ~p = My isnot stupid

.

There are some basic facts Aaws

that are always true .

P < ⇒ 9 Pond 9 are( logically )equivalent

=P)s⇒P•

mat )

• ( P 1 P ) < ⇒ P kind of- boring laws !

banda statementwith itself

• ( Pvp ) ←→ p•P¥.3statements

Little bit

÷¥±÷¥÷i÷¥¥¥II¥÷P¥¥!¥IEIIi

"

F F

-

• PV ( 9 nr ) ⇐>( Pv9 ) ^ ( Pvr )

.

•De Mongan 's Law

~ ( Pv 9) ⇒ (~P)^(~9 )

÷^ 9 )

P 9

¥÷⇐"tt.

T T T#TF#T÷• P → 9 ( conditional

statement )

p→9←→ (g) → (p )

Contrapositive )

Example If Datawftp.geg#imagined- sogou.ae#

÷Recall IF table for p - q . .

¥f'¥fTI¥/÷Etea⇐ama

F

T

In Computerengineering

( logical)"

gates"

⇒¥ , #

:*#÷

Tautology - a statement alwaystrue t

contradiction - - - - - - - - false=

- c

• P v GP ) ⇐> t

p ^ ( ~p )