Logic and Proposition Simplification: A Study of Truth Statements, Symbolic Representation, and Proof Techniques
This assignment focuses on logic, symbolic representation, and proof techniques in mathematics.
Ethan Wilson
Contributor
4.1
36
5 months ago
Preview (2 of 2 Pages)
100%
Purchase to unlock
Page 1
Loading page image...
Logic and Proposition Simplification: A Study of Truth Statements,Symbolic Representation, and Proof Techniques1.Which of the following are statements?1. She is a mathematics major.2. 128=263. All that glitters is not gold.4. Sleep tight anddon’t let the bedbugs bite.Soln.A sentence that can be judged to be true or false is called a statement.1.She is a mathematics majoris astatementas it can be either true or false.2.128=26is astatementas it is false.3.All that glitters is not goldis astatementas it can be either true or false.4.Sleep tight and don’t let the bedbugs biteis not a statement.2.Let A, B, and C be the following statements:A: John is healthyB: John is wealthyC: John is wiseUse A, B, and C as defined above totranslate the following statements into symbolic form.1.John is not wealthy but he is healthy and wise.(B′)∧(A∧C)2.John is neither healthy, wealthy, nor wise.A′∧B′∧C′3.John is wealthy, but he is not both healthy and wise.B∧(A∧C)′3.Simplify the following proposition to 2 logic operations using the laws of the algebra ofpropositions. Write each stepon a separate line with the algebra law you used as ajustification. Missing steps will be penalized.(P′∧Q′)∨(P′∧Q)∨(P∧Q′)Soln.By identityP=(P∨P)andassociativitywe have,(P′∧Q′)∨(P′∧Q)∨(P′∧Q′)∨(P∧Q′)Bydistributivitywe have,(P′∧(Q′∨Q))∨((P′∨P)∧Q′)Reduction by the law of excluded middleP′∨P=1weget,(P′∧1)∨(1∧Q′)Bythe neutral element definitionP′∧1=Pweget,