recategorized by
8,499 views
41 votes
41 votes

If the proposition $\lnot p \to q$ is true, then the truth value of the proposition $\lnot p \lor \left ( p \to q \right )$, where $\lnot$ is negation, $\lor$ is inclusive OR and $\to$ is implication, is

  1. True
  2. Multiple Values
  3. False
  4. Cannot be determined
recategorized by

4 Answers

Best answer
65 votes
65 votes

Cannot be determined.

From the axiom $\lnot p \to q$, we can conclude that $p \vee q$.

So, either $p$ or $q$ must be TRUE.

$$\begin{align}
&\lnot p \lor (p \to q)\\[1em]
\equiv& \lnot p \lor ( \lnot p \lor q)\\[1em]
\equiv&\lnot p \lor q
\end{align}$$

Since nothing can be said about the Truth value of $p$, it implies that $\lnot p \lor q$ can also be True or False.

Hence, the value cannot be determined.

edited by
10 votes
10 votes

given that $ \lnot p \to q$ is true

A proposition can have only 2 possible values namely true or false. Here  I feel “cannot be determined”(option D) is a more suitable answer than “multiple values”(option B) because propositional variables are similar to variables in programming which can have only one value at a time.

3 votes
3 votes

We need to look only for the GREEN case as in that only P’ → Q is true .

And for these three (GREEN) cases we have truth value for some cases and false for some cases .

So the value can’t be determined .

Answer will be D.

Answer:

Related questions

21 votes
21 votes
3 answers
1
Kathleen asked Oct 8, 2014
4,210 views
Obtain the principal (canonical) conjunctive normal form of the propositional formula $$(p \wedge q) \vee (\neg q \wedge r)$$ where $\wedge$ is logical and, $\vee$ is inc...
28 votes
28 votes
6 answers
3
Kathleen asked Oct 8, 2014
14,223 views
Let $R$ be a symmetric and transitive relation on a set $A$. Then$R$ is reflexive and hence an equivalence relation$R$ is reflexive and hence a partial order$R$ is reflex...
23 votes
23 votes
2 answers
4
Kathleen asked Oct 8, 2014
10,678 views
A computer system has a $4 \ K$ word cache organized in block-set-associative manner with $4$ blocks per set, $64$ words per block. The number of bits in the SET and WORD...