Question

In: Computer Science

A. Use truth tables to verify these equivalences 1. p∨p ≡ p 2. p∧p ≡ p...

A. Use truth tables to verify these equivalences

1. p∨p ≡ p

2. p∧p ≡ p

3. p∨(p∧q) ≡ p

4. p∨q ≡¬p → q

5. p∧q ≡¬(p →¬q)

6. p ↔ q ≡ (p → q)∧(q → p)

B. Determine the truth value of each of these statements. (Assume the domain of variables consist of all real numbers).

1. ∃x(x2 = 2)

2. ∃x(x + 2 = x)

3. ∀x(x2 + 2 > 0)

4. ∀x(x2 = x)

Solutions

Expert Solution

1.

True

2.

True

3.

True

4.

True

5.

True

6.

True

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++========

1.
∃x: (x^2 = 2)

x^2 = 2
x = √2 = 1.4142

Since value of x exists for the condition, hence value for the above quantifier is truth.

2.

∃x: (x + 2 = x)

x + 2 = x

==> x - x = 2 not possible.

So this statement is false.

3.

∀x: (x^2 + 2 > 0)

x = 1, 2, 3...

value of x^2 will always be +ve, so this holds true,

for x = -1, -2, -3

x^2 will always be true, so true.

Hence this statement is true.


4.
∀x: (x^2 = x)

if x = 1

x^2 = 1 = x, so true.

x= 2
x^2 = 4 != x, so false.

since there is universal quantifier so, it must hold true for all values of x.

So this statement is false.

IF THERE IS ANYTHING THAT YOU DO NOT UNDERSTAND, OR NEED MORE HELP THEN PLEASE MENTION IT IN THE COMMENTS SECTION,


Related Solutions

Propositional Logic Using operator properties and other logical equivalences (not truth tables), prove these statements. 1....
Propositional Logic Using operator properties and other logical equivalences (not truth tables), prove these statements. 1. ((p→r)∧(q→r)∧(p∨q))→r (tautology) 2. ¬(q→p)∧(p∧q∧s→r)∧p (contradiction) 3. (p→q)∧(p→r)≡p→(q∧r)
a) Use truth tables to show that the following are valid arguments: i. [p  (p...
a) Use truth tables to show that the following are valid arguments: i. [p  (p → q)] → q ii. [(p → q) ∧ (q → r)] → (p → r) b) Use truth tables to show the logical equivalence of: i. (p → q) ⇔ (¬p ∨ q ) ii. (¬p ∨ q) ∨ (¬p  q) ⇔ p
Prove the following equivalences without using truth tables, and specify at each step of your proof...
Prove the following equivalences without using truth tables, and specify at each step of your proof the equivalence law you are using. (a) ¬ (p ∨ (¬ p ∧ q)) ≡ ¬ p ∧ ¬ q (b) ( x → y) ∧ ( x → z) ≡ x → ( y ∧ z) (c) (q → (p → r)) ≡ (p → (q → r)) (d) ( Q → P) ∧ ( ¬Q → P) ≡ P
Set up the addition and multiplication tables for Z3 and Z6. Use these tables to verify...
Set up the addition and multiplication tables for Z3 and Z6. Use these tables to verify that (Z3, +), (Z3 \ {0}, ·) and (Z6, +) are groups, but (Z6 \ {0}, ·) is not a group. In which finite field does "25 divided by 5 is 14" hold?
Use Boolean algebraic laws to prove the following equivalences: [ ( p → q ) ∨...
Use Boolean algebraic laws to prove the following equivalences: [ ( p → q ) ∨ ( p → r ) ] ⟷ [ p ⟶ ( q ∨ r ) ] ¬ [ ¬ ( p ∧ q ) ∧ ( p ∨ q ) ] ↔ [ ( p → q ) ∧ ( q → p ) ] If you are able to explain some of the thought process behind the problems, that would be amazing. Thanks
use truth tables to determine whether or not the following arguments are valid: a) if jones...
use truth tables to determine whether or not the following arguments are valid: a) if jones is convicted then he will go to prison. Jones will be convicted only if Smith testifies against him. Therefore , Jones won't go to prison unless smith testifies against him. b) either the Democrats or the Republicans will have a majority in the Senate. but not both. Having a Democratic majority is a necessary condition for the bill to pass. Therefore, if the republicans...
Create truth tables for the following expressions. Include all necessary negations and sub-expressions. ( p ∧...
Create truth tables for the following expressions. Include all necessary negations and sub-expressions. ( p ∧ q ) ∨ ( ¬ r ) ¬ ( p ∨ q ) ∧ ( r ⊕ s ) [ ( q ⊕ r ) ∧ s ] ⟶ p If you could explain the thought process behind how you did these that would be amazing, I am trying to learn the reasoning as I practice. Thanks
prove or disprove using logical equivalences (a) p ∧ (q → r) ⇐⇒ (p → q)...
prove or disprove using logical equivalences (a) p ∧ (q → r) ⇐⇒ (p → q) → r (b) x ∧ (¬y ↔ z) ⇐⇒ ((x → y) ∨ ¬z) → (x ∧ ¬(y → z)) (c) (x ∨ y ∨ ¬z) ∧ (¬x ∨ y ∨ z) ⇐⇒ ¬y → (x ↔ z)
Construct a truth table for the statement [q∨(~r∧p)]→~p. Complete the truth table below by filling in...
Construct a truth table for the statement [q∨(~r∧p)]→~p. Complete the truth table below by filling in the blanks. (T or F) p q r ~r ~r∧p q∨(~r∧p) ~p [q∨(~r∧p)]→~p T T T T T F T F T T F F
1. write a truth table using this symbol: --> 2. write the inputs for the truth...
1. write a truth table using this symbol: --> 2. write the inputs for the truth table to the left of the --> and write the outputs for the truth table to the right of the --> 3. write the compliment, or NOT using ' As an example: The truth table for AND is written this way: A B --> A AND B 0 0 --> 0 0 1 --> 0 1 0 --> 0 1 1 --> 1 or...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT