Using logical equivalence laws, show that (((p v ~ q) ⊕ p) v ~p)
⊕ (p...
Using logical equivalence laws, show that (((p v ~ q) ⊕ p) v ~p)
⊕ (p v ~q) is equivalent to p v q. v = or, ~ = not, ⊕ = exclusive
or (XOR). Please show the steps with the name of the law beside
each step, thanks so much!
Solutions
Expert Solution
[this is because from the definition of XOR we have
]
[this is because
]
[this is because
]
[this is because ]
[this is because
]
[this is because from the definition of XOR we have
]
[this is because
]
[this is because ]
[this is using the DeMorgan's Law
]
[this is obtained just by changing the parentheses]
Prove that (((p v ~q) ⊕ p) v ~p) ⊕ (p v ~q) ⊕ (p ⊕ q) is
equivalent to p ^ q. Please show your work and name all the logical
equivalence laws for each step. ( v = or, ~ = not, ⊕ = XOR)
Thank you
Using the relationship for internal pressure πT = T
(∂P/∂T)V – P, show that for a gas that obeys a truncated
virial equation of state: Z = PVm/RT = 1 +
B(T)/Vm, the internal pressure may be approximated as
πT ≈ RT2(Vm)-2∙(ΔB/ΔT).
Estimate the internal pressure at 1.0 bar and also at 10.0 bar for
a hypothetical real gas at 275K given
that B(T) = -28.0 cm3⋅mol-1 at 250K and
-15.6 cm3⋅mol-1 at 300K for this gas.
1. Show that the argument
(a) p → q
q → p
therefore p V
q
is invalid using the truth table.
( 6 marks )
(b) p → q
P
therefore p
is invalid using the truth
table. ( 6 marks )
(c) p → q
q → r
therefore p →
r
is invalid using the
truth table. ( 8 marks )
Let X be Z or Q and define a logical formula p by ∀x ∈ X, ∃y ∈
X, (x < y ∧ [∀z ∈ X, ¬(x < z ∧ z < y)]).
Describe what p asserts about the set X. Find the maximally
negated logical formula equivalent to ¬p. Prove that p is true when
X = Z and false when X = 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