edited by
351 views
1 1 vote

Let $\varphi$ be a propositional formula on $n$ variables, with $n \geq 1$. Consider the following statements.

  1. $\varphi$ is satisfiable
  2. $\neg \varphi$ is unsatisfiable
  3. $\varphi$ is a tautology
  4. $\neg \varphi$ is a contradiction

Which of the following is ALWAYS TRUE for all such formulas $\varphi?$

  1. (i) $\not \Leftrightarrow$ (ii), and (ii) $\Leftrightarrow$ (iii) $\Leftrightarrow$ (iv)
  2. (i) $\not \Leftrightarrow$ (ii), and (ii) $\not \Leftrightarrow$ (iii), and (iii) $\Leftrightarrow$ (iv)
  3. (i) $\not \Leftrightarrow$ (ii), and (iii) $\not \Leftrightarrow$ (iv), and (ii) $\Leftrightarrow$ (iii)
  4. (i) $\not \Leftrightarrow$ (ii), and (ii) $\not \Leftrightarrow$ (iii), and (iii) $\not \Leftrightarrow$ (iv)
  5. (i) $\Leftrightarrow$ (ii) $\Leftrightarrow$ (iii) $\Leftrightarrow$ (iv)

     

1 Answer

0 0 votes

I think option A is correct. Let's go through all the statements and find out. I’ll refer to the propositional formula as x for simplicity.

First, let's simplify some statements so that it's easier to use them later.

  • Statement (ii) says [¬x] is unsatisfiable, which means there is no interpretation where ¬x is true. This implies that ¬x is always false, which means x must be always true. In other words, x is a tautology.

  • A tautology is always logically equivalent to statement (iii), which presumably states that x is a tautology.

  • Now, statement (iv) says [¬x] is a contradiction, which means all interpretations of ¬x are false. Again, this implies that all interpretations of x are true—so x is a tautology, which again is equivalent to statement (iii).

So far, we know that statements (ii), (iii), and (iv) are logically equivalent.

Now, statement (i) says x is satisfiable, which means there is at least one interpretation where x is true. However, it doesn't say anything about the other interpretations—they might be false. So, x is not necessarily a tautology.

That means statement (i) is not logically equivalent to the others.


Final Conclusion:

Statements (ii), (iii), and (iv) are equivalent.
Statement (i) is not equivalent to them.

Answer:
Position:
Show:

Related questions

2 2 votes
1 1 answer
493
493 views
Shubham Sharma 2 asked Jun 16, 2025
493 views
What is the solution to the following recursion?$$\begin{array}{l}T(n)=T\left(\dfrac{n}{2}\right)+T\left(\dfrac{n}{3}\right)+T\left(\dfrac{n}{6}\right)+O(n), \\T(n)=5 \qu...
0 0 votes
2 2 answers
520
520 views
Shubham Sharma 2 asked Jun 16, 2025
520 views
Consider the following sets.The set of all natural numbers $\mathbb{N}$.The set of all rational numbers $\mathbb{Q}$.The set of all functions from $\mathbb{N}$ to $\{1,2,...
2 2 votes
1 1 answer
398
398 views
Shubham Sharma 2 asked Jun 16, 2025
398 views
Consider the following languages:$L_{1}$ is the set of languages recognised by a deterministic pushdown automaton.$L_{2}$ is the set of languages recognised by a nondeter...
1 1 vote
1 1 answer
352
352 views
Shubham Sharma 2 asked Jun 16, 2025
352 views
Given a directed graph $G$ and an initial vertex $s$, we would like to $explore$ the graph from $s$, that is, starting from $s$ see all vertices along a path.For example,...