Consider three decision problems P1, P2, and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?
Note that in general if L1 ≤ L2,
L2 decidable ⟹ L1 decidable and
L1 undecidable ⟹ L2 is undecidable
Given that P1 is decidable and P2 undecidable.
Consider (a) P3 is decidable if P1 is reducible to P3 i.e. P1 ≤p P3 and if P1 is undecidable, then P3 would be undecidable.
But it is given that P1 is decidable, therefore we cannot use this theorem.
So, (a) is false.
Consider (b) P3 is undecidable if P3 is reducible to P2
i.e. P3 ≤p P2
Now if P3 is undecidable then P2 is undecidable but nothing is given regarding P3.
Also if P2 is decidable, then P3 would be decidable but it is given that P2 is undecidable, so we can't use this.
So, (b) is false.
Consider (c) P3 is undecidable if P2 is reducible to P3
i.e. P2 ≤p P3
Now if P2 is undecidable, this would mean P3 is undecidable. Since it is given that P2 is undecidable, therefore, P3 is undecidable is correct.
So, choice (c) is correct.