Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
31 views
Discrete Mathematics Chapter 1
Logic Mathematics
Uploaded by
Yaseen Alrawahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save Discrete Mathematics Chapter 1 For Later
Download
Save
Save Discrete Mathematics Chapter 1 For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
31 views
Discrete Mathematics Chapter 1
Logic Mathematics
Uploaded by
Yaseen Alrawahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save Discrete Mathematics Chapter 1 For Later
Carousel Previous
Carousel Next
Save
Save Discrete Mathematics Chapter 1 For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 28
Search
Fullscreen
: Chapter. | funy we read Bg] __ tules inmath ii To disHingvish bekween | valid and ipvalicl mathematical cuguimients | v Statement that decleates afack that is either “We or false (but noe both) kL ALOMIC [pepesition| a proposition Hhat Cannot be expressed fn berms of simpler Propositions vy | Compound | | Pepesition a propesition Neat is preduced by Combining one of more atomic Propositions.Proposi Fons] [Not preqpasitions| o Muscetk iS in Oman. Oo How ove you? erga 2 o Xt=3 olt2=5 ey - “y+ b3and x76 ale nok propesitians \ (Ore ) UNH a value ef tne variable (x) \ fs assigned for example 276 900 IF the pyopesition True «Ty Js HUE 1+1=2 ‘is tue | Truth value of co Proposition | | : Falso\ IF Khe Propesitian «fn fs Fale 112=5 Is false\w The Negation | Ee Proposition Lek p be a | peo Desi tion. The negation | oF P (denoted by "P) is the statement "Ik 1S not the case that Pp". ay The t¥th table oF the negation ee T | F | FIT | Kio 2)° omer notations For the negations we Ce) GP) (Np) (PF) ~P) CP) | Jexamples Find tne negation of the prosition | | | P: Muscat is in OMan-« Solutions "Pe It is Not Lhe case Hak Muscat | ts in Oman. | ay | “Ps MUS cot is Nok i171 OMe.he Gonjunctioy of a Prop si tions Let panda be PiOPesitions. The Gogjunction of pand G (denoted by pag) is Ene | PrEpesition " Pp and Q! which is Hue iF Pand 4 ai Hue and False ofnewike | Vv The +Uth table of the Cajunction [Pe |g |Paq | [T|T LT | [TF FF | ee F\E FE | Examples Find PAG AE P: The Sun is Shining and Qsltis roining. | Solutions PAC: The Sun is Shining, and it is rainy, | or PAG The Sun is Shining Dut ibis caning or PACs Hae Although tesun isshini} 4 SlLite OO aa KS ")Xo The Digjunction oF. Propositions Let p andq, be propositions. The olgjunction oF p and 4 (denoted by pyd) is the Proposition "porg." which is Hue if ab leaSt ONe OF P andg. is WUR, | | Vv The +fUth tale of tne disjunction | P| 4 [pv4 ele eee Tle | tT = alee T FOLF c [Examples what pvq if Pp: go to muscat and gz !gote Sonar: | Solutions | pvgs!go to spar or to muScad of bol.| or oF | fepasitions let pand q be plOOsitions. Te exculsiveor oF pand q (denoted by P&Y) is tue If | CXAMY One OF P and. is HUE and False if | both are Have Of botn arefalse. L Te tot rable of the exclusive-or for fr fe TIE 7 E T Te _E. F Fo “Examples Find peaq if Pp: !beY a cor with | my $2009 and 4:1 byya pc with my, $2009 Solutions p@q: | buy with my §2ooveitner a Car of aft.\e fe Uni-conditional | Statement © Implication) Let p and g be prepositions he conditional Statement Cimplication) is the proposition "if p,theng." or "p implies q" or " ponly iff or "4 whenever P!' wy The tfuth tale of the implication Tg pag Pp Ca Ts pa] OPS False (rie. | ec [j-only if qis —F iT | Ti FE, but pisT [Flr iy : coe ie | [Examples p: Bis my Sister. 4: Bis a gil. In which case P34 Is false? | Solutions | FE the Proposition P iS ttve,bukg. ts false, | ten NO way tat my Sister be q boy. P 4 pP3q | ie FEThe Biconditional | Statement CXNOR) |Cbi-Imp! icakion) Let pand q be propositions. Te bicondlitionel | Statement (lenoted by pep is the Proposition " p iF anc only iFG" and it is Hue onlyif P and q. have the same Huth vole The Hom toarple oO the bicenaitiona| [P| 9 | peg | T T T | TOF F - a, Eo E F ite Examples p: Aand B have the Same pavenl 4: AandR are sister. what IS PF | Solutions P92 A and B have the same parents | if ard only if they ove Sistts | | | |THe Converse], 4 5p oF Pog Additional | | conditional | } The contrapesitive | 1 4 Skadement |4> > FP foamed fr OF POG pPoq The Inverse P+ Yoreos | p> [Pie PAe ee eae pa] GP TITIFIF] 7 ee Pelee ae tt | EUTIT IF] roo} TOE im [FIFIT [tT], To) rr Tt | equivalent = equivalent‘Classification | of Compound | ‘PIOPOSItIONS | | Tavtotagy | A compound propasition thet iS always uve | no matter the tru values of the variables | | Contadiiction| [© compourd propesition tnat is aluays falso” no maker the uth valves of the voricables| icentingency — L lA comeourel proposition that is neimer | | tautology nor contradiction. 020 Exam ples PvP Is tautology Pa tp iS ContCliction Dv@ 7S contingencyPropositional | 2 Equivalant | Lek Sand r be compouncl propositions, 5 and r | ave called logically equivalent if the have the — Same truth valves. Ang compound propasitions are legically equivalent if and only If Ger) ig a kavhology The notation (s=r) denotes that sand rc ove logically eciivalent examples Show Hal 1¢p @Q)\= (Pod) solutions Lek S='(P<*9) and m= (pes'q) Pot 14 pedi 5 R SeR T/TIF | 7 | FE EIT TJF IT) & YT iT IF FIT |F) F | T (tr [tT Ele T oT F c T SINCE SR is a tavlokyy, the S=REquivalenag PAT=P PvF=P PpvT=T PAF=E “Pvp=P pap=P TOpI=EP Pvqeqvp | PACE ANP “(pvqnr = Pyar) - (DAQMALT=PACLAY) PCA AY) = (pvq) A(pvr) PACQYT) = Pagy ar) | V(PAD = Pv 1g. TCPV&)= IPAQ PY(PAM=EP pA (PVGy=P Pv iPp=T DATIP=E ‘Ts taulology ame Iclentiky Lows bomination Laws ~[olempotent — Laws » bouble Negation Low commutative Laws Associative LOWS DistYiby tive Laws be Morgans — Lows Absofbtion Laws - Negation Laws. Fscontraclic ios)| Laws Involving | x conditiona( Stakements p>qetpyg P—F="4—>"P Cits contapositive) PYG = pq 1(P39)= 1@pvq)= PAN. PAQ= *(p—31q) (@3q)n(p-sr)< P+ (Lav) (P>DvP—r)=z Pacqyr) (PSN AqQar)= (pYy)or (Pr) Vv (Gr )= PAG) — Fr Nore: given that LHS=RYS, Hens LHS @RHSET/ Laws Involving | | bi-conditional | Stettemonts P94 =) AG—>p) | POeGEPord, P= (PAQ) VAPAIQ) pegs tpe@q) _P®F = VBA pv 1g) = (P07q)vaPAQ) TPQ) = Po17F “(PIEq) -» FP | (P only if F) = P>4 Peg (P if ancl only if @) Y of | QP) » (>H\o | Ps¢=7Pvq._ by Tbh Table Cb) NN 7m nH) 4 4 - dan 4 9 pq ce PPS (P09) TT] capva ; oT | PoeQe (Pad) vapaiq) by Truth Table SS 4 W=(PAA GPa) An} ni GQ)The | Preclicahe -\)| (Precical | Statement involves verTables) €xaIY\ ple Tr j 23 The sinjert Be / The Statement ” predicate IF P denoke the predicate “larger than 3" and 9% is the varialole | omens Dose} is called tne proposikione) Function and written as: Poze); "9c is larger trans" or Pec): "273" Notes the propositional function ig nok PloPESikion uNH! valves are assigned to the variables.Example. Qczy) "X= 443" hot ale the truth values PF QC,2) and QGP) ONG ee ich) is Paleo CL) QGoy: | B=end!, which is tect) Example .23 R(% 9,8): "ety =E" whod are tne toulh values of RCj2,3) and R@o,1) BG 2 2 )euieo al jushich is Hue RC0,0,!):"o+r0=1", which 16 False (F) 200 ExamP!2.3¢ M(%54):" E7Y43") Whak are the +Huth 2) and MC40) 243" which is false () 7073" which is Hue CT) se"creak proposition From Propositional Function (proposikiona| | | statement) L v OO a _ _ Assigni | i i | ue values Quantification Q - vari ples Uae extental quantificatir quantification a 200 The Process OF creating | Plopositions yom a propositional Quantifizdion functienGtatement) whicn Expresses the extend bo which +e piodicale is Hue overa KageLo’ La] upoWeO SPIO oe Bun ule Wd Out UBS (a's) Ullowoo ou aut UL x jlo. fo anim avo : iP) 4 ! CddXE ul x pUautale fais iguend COd UOUM $1 OKOg USUM ONO OT yonuotsya La’ ul ; ne ca’s] CI ud 4Soa| 4 UsOWUOP OUt UI UpWOP Out UI JO4 SSH S1 % |po 305 ON COdMA, 3 Jo sanyon 1215 40H (Od YOUM St Gog UBUM \}P 404 OOd), reseniun By (2S[PJ UBUM) 2 ONULUAUM —_alJORON THOWATHAG 4Olyqu0n'9 a | | Jo !4lqu0ng © £90) — o6uor U! EalgZUONb UGHOUN; poueyisodatd 0 eG (Od 437Keneeangeh An element for Wnion POO is false Example.l: Tf pes): "e%< 15 [0,uN"! find the trom value of Ve DCX) Woepcse) 1S False singe PCI) is q counterexample Example.22 if Qee:"Z4l72" What ts the truth valug of Wx Cetly9¢) where the domain is all real Num oer, VWxpCx) is HU, sinca is tue for all feal num (Here is no counterexample) ExomPk.3 iF Pcs): "2272" what is the t/GIN Valve of Vac pcacy in.clomain @.all read num bars) (b-4 Il" inyegers) %. Wa Csincwel ! Ye Wa POX) “ since rk, be ncire conter examples ~ eo b. Vrpcy) IsT Cro couthor exampleExam ple. 4 Find te tut value of f Ax (%73) (. domain is / eal nuMber ) (io. Domain 's fe, \J) a. JxGezs) in all real number is Tue, one exaimple illustrate that 473 by 1EC%73),To,\) Is False pecas %1ses For ofl 2 intel) Example.5 Qc): NaH =2", Find +ne tyuth valU@ of 4xAQc%e) and VYoacQ C20) in the domain (cdl - (ead numbers)importa, cing the domain where tix G7) is 7 anc) is ee te 77, © >, pe) 7° X (2-70 means it is positive of O and it is cosfect ifs A: Both oe +VE (4) 4¥e 70) (x70) A\ (%-| 79) > 0629) (0071)\o 9 & me domain where Vx ce*zx) ole is? (SI) U Cake) UGE) VLD) = (X71) UC go) can alo be written as God, 0] U [1 0)_ Sequence of propositions ends \ (Mfgument |) up with @ conclusion emgument “Sequence of campound proposition FOr involving ploPositional variables promises (Ol! PIOPoSItIOns (atomic or compan). except the last Proposition conclsion ne Fina) preposition valid IE the truth of all Posmisos (arqumentl implies the conclusion is tive. | KEIQU or ‘or @igument — IF Permises implies conclusian Form) _is toutology»Argument form P, i RB, Awe AP,—3 4 \ i uA Permnises conclusion ————— 00 [ Rules | | oF InFerence | | Sek of valid arguments used to show the validity of compltcatect argument | Forres without the need! of building oF _ truth Fables fe clo So. P, valid qigument p in rules of 2 Inference oO q Berens Ff is Five and P, is true,tnen the conclusion 4 must be Hee (because Gand P, are +12. Therfore, PAR—>4 is FaukoloyyRULe | of Inference Taurology Nome Pp moclUs P>o \)—= cio (Pacp-s)) = 4 pence ace MoOdvUs P3aQ C4439) "P ss Loliens = 1p po3q Hypothetical asr | (Papnqgen)> Pa) yee 7 ipor syllOgism Pvq : Disjunctive a (CPVAANG)— P . =P Syllog isi Addition a qa — (Pv 4) é& PVE. app Simplification FAY (pA —=>y ee q | 2 CPACQ) j ong H)— CPAG) conjunction Pv q apr (PVD AGP vry) MGV). Resolution “avy% " Cxamples Determine wether Me afgumen| given is valid and celemine werner KS Conclusion musk be Live because of the validity of rhe argument. NE NZ 73, chen GY >(%5, we Know Hat Vi 73,,. consequently, Cat=2734=y! * Dropositions: o Pra 234 4 PermiS es p-3g i 2 J p oe a + the aroument is valicl == | ) AQUs DONeNS q 4 OY OdUs Pol howevel, we cannot criclu ca@clusion |[s +(JQ ,pece Tks pormises 1s fodse (18794) >the agument is valid, but theexample2s Snow Har He proposition" |r isn sunny this afteineon andl if iS Colder than yesterday" "we will go swimming only if iF Is sunny" "IF we clo not go SWim-MiNG , Hen we will Fake a canoe HIP" ang "IF we take a canoe Hip, Hen we wil) he home by Sunset" lead fo the conclusion " we will be heme log sunseH 4 PfOPOSIEIONs: ML PrlFS sunny Enis afternoon’ GI's colder tnan yesteicey' re we'll go swimming" : 5: welll go a canoe trip E:"we'll bo home by Sunset" 4 Parmises IPAQ >» yoP, Ws, 8 coNclUSiON , : A POOL ong ( (PAA) ACP) A Crs) asst) PP OAS PA CaP) A O48) A Gt) wf FOP G ar narasyagrd b, SA(s—t) ———> ¢ (- ae
You might also like
MAD101 Assignment PDF
PDF
No ratings yet
MAD101 Assignment PDF
61 pages
Unit - Introduction to proof
PDF
No ratings yet
Unit - Introduction to proof
33 pages
Discrete Mathematics - 240417 - 104029
PDF
No ratings yet
Discrete Mathematics - 240417 - 104029
44 pages
MFCS Unit-1
PDF
No ratings yet
MFCS Unit-1
36 pages
DSGT Module 1 Notes
PDF
No ratings yet
DSGT Module 1 Notes
26 pages
Unit I Mathematical Foundation I
PDF
No ratings yet
Unit I Mathematical Foundation I
36 pages
Mfit Unit 1
PDF
No ratings yet
Mfit Unit 1
21 pages
Unit 1-mfcs
PDF
No ratings yet
Unit 1-mfcs
40 pages
Maths Unit 1
PDF
No ratings yet
Maths Unit 1
11 pages
Module 1 (Fundamental of Logic) - 230910 - 195405
PDF
No ratings yet
Module 1 (Fundamental of Logic) - 230910 - 195405
86 pages
Module 1 (Fundamental of Logic)
PDF
No ratings yet
Module 1 (Fundamental of Logic)
86 pages
maths notes
PDF
No ratings yet
maths notes
25 pages
Unit 1
PDF
No ratings yet
Unit 1
33 pages
Lesson 1 Propositional Logic
PDF
No ratings yet
Lesson 1 Propositional Logic
30 pages
Logica Proposicional by Megabyte
PDF
100% (1)
Logica Proposicional by Megabyte
23 pages
M1
PDF
No ratings yet
M1
40 pages
Ranvijay Saddab
PDF
No ratings yet
Ranvijay Saddab
7 pages
HWKI
PDF
No ratings yet
HWKI
10 pages
DM - UNIT I
PDF
No ratings yet
DM - UNIT I
47 pages
Unit 1
PDF
No ratings yet
Unit 1
10 pages
Discrete Mathematics
PDF
No ratings yet
Discrete Mathematics
228 pages
Logic: Mathematg Oals: Oreasontlg. Logic Cohiclh Uses A Symbolic Laguage To
PDF
No ratings yet
Logic: Mathematg Oals: Oreasontlg. Logic Cohiclh Uses A Symbolic Laguage To
14 pages
Logic
PDF
No ratings yet
Logic
28 pages
01-Introduction-Chapter01-Propositional Logic
PDF
No ratings yet
01-Introduction-Chapter01-Propositional Logic
45 pages
UNIT 4-Mathematical Logic (18MAT11)
PDF
No ratings yet
UNIT 4-Mathematical Logic (18MAT11)
41 pages
Maths - 1
PDF
No ratings yet
Maths - 1
73 pages
Unit 2 Example of Logics Part 2
PDF
No ratings yet
Unit 2 Example of Logics Part 2
44 pages
Lecture Notes
PDF
No ratings yet
Lecture Notes
107 pages
03_Propositional_Logic
PDF
No ratings yet
03_Propositional_Logic
22 pages
Unit 1 - Session 1
PDF
No ratings yet
Unit 1 - Session 1
39 pages
(m4 Main) Logic
PDF
No ratings yet
(m4 Main) Logic
75 pages
Mathematical Logic
PDF
No ratings yet
Mathematical Logic
9 pages
1. Logic
PDF
No ratings yet
1. Logic
39 pages
Logic & Set_241122_091711 (2)
PDF
No ratings yet
Logic & Set_241122_091711 (2)
36 pages
Conditional Propositions and Logical Equivalence
PDF
100% (3)
Conditional Propositions and Logical Equivalence
30 pages
Discrete Mathematics: Propositional Logic
PDF
100% (1)
Discrete Mathematics: Propositional Logic
46 pages
DM - Mathematical Logic
PDF
No ratings yet
DM - Mathematical Logic
12 pages
Mathematical Reasoning
PDF
No ratings yet
Mathematical Reasoning
7 pages
cours notion de logique en
PDF
No ratings yet
cours notion de logique en
10 pages
Minor Data Science Content
PDF
No ratings yet
Minor Data Science Content
12 pages
mathematical-reasoning-sheet
PDF
No ratings yet
mathematical-reasoning-sheet
13 pages
DM Unit-1
PDF
No ratings yet
DM Unit-1
52 pages
CSET106-1 15-Jan-2024 13-30-34
PDF
No ratings yet
CSET106-1 15-Jan-2024 13-30-34
9 pages
Unit 2 Ch-Logic
PDF
No ratings yet
Unit 2 Ch-Logic
44 pages
Discrete Mathematics AND Its Applications
PDF
No ratings yet
Discrete Mathematics AND Its Applications
42 pages
Discrete Mathematics AND Its Applications
PDF
No ratings yet
Discrete Mathematics AND Its Applications
42 pages
Basic Mathematics
PDF
100% (3)
Basic Mathematics
490 pages
Csa Unit-1 Final
PDF
No ratings yet
Csa Unit-1 Final
148 pages
Mathematical Logic
PDF
No ratings yet
Mathematical Logic
6 pages
DM Aprt-A Full
PDF
No ratings yet
DM Aprt-A Full
99 pages
DM (Unit 1) Notes
PDF
No ratings yet
DM (Unit 1) Notes
37 pages
Module 1
PDF
No ratings yet
Module 1
98 pages
CH 1 Note
PDF
No ratings yet
CH 1 Note
18 pages
MMW.04 (Logic)
PDF
No ratings yet
MMW.04 (Logic)
61 pages
Mathematical Logic Lecture Notes
PDF
No ratings yet
Mathematical Logic Lecture Notes
11 pages
Stlftlfflaria: To Hence
PDF
No ratings yet
Stlftlfflaria: To Hence
17 pages
Basic Math For Engineers & Science Students - by Saki Billah
PDF
No ratings yet
Basic Math For Engineers & Science Students - by Saki Billah
66 pages
Chapter 1 - Propositional Logic
PDF
No ratings yet
Chapter 1 - Propositional Logic
20 pages
ECCE4436 - Advanced - Control - 3
PDF
No ratings yet
ECCE4436 - Advanced - Control - 3
23 pages
Discrete Mathematics Chapter 6
PDF
No ratings yet
Discrete Mathematics Chapter 6
6 pages
Electric Machine Chapter 4
PDF
No ratings yet
Electric Machine Chapter 4
44 pages
Electric Machine Chapter 2
PDF
No ratings yet
Electric Machine Chapter 2
47 pages
Electric Machine Chapter 1
PDF
No ratings yet
Electric Machine Chapter 1
26 pages