Use the laws of propositional logic to prove each of the following assertions. Start by defining a generic conditional statement p → q, and then restate the assertion as the equivalence or non-equivalence of two propositions using p and q. Finally prove that the two propositions are equivalent or non-equivalent. For example, the statement: "A conditional statement is not logically equivalent to its converse" is proven by showing that that p → q is not logically equivalent to q → p.

answer: 1 + 1 = 11

step-by-step explanation:

x =-.20752

step-by-step explanation:

4^(x+2)=12

4^(x+2)=12

take the log base 4 on each side

log 4 (4^(x+2) = log 4(12)

we know log b(a^y) = y log b (a)

(x+2) log 4(4) = log 4 (12)

x+2 = log 4 (12)

we know   logb c = loga c/loga b

we want to convert to base 10   so a = 10

by default, we do not write the 10   c = 4   and b = 10

log4 10 = log 12/log 4

log4 10 = log 12/ log 4

x+2 = log 12/ log 4

subtract 2 from each side

x +2 -2 = log 12/ log 4 -2

x = 1.79248125 -2

x =-.20752

could you provide figure.