Proofs by reduction are a fundamental technique in computational complexity theory used to establish the undecidability of a problem. This technique involves transforming an instance of a known undecidable problem into an instance of the problem under investigation, thereby demonstrating that the problem under investigation is also undecidable. The general logic behind proofs by reduction