6.8.2. Constructing Duals

The dual of a compound proposition is denoted by this notation s* and what exactly is the dual? How do we construct a dual of a compound proposition? What we have to do is wherever we have an occurrence of conjunction in s we replace them by a disjunction. Wherever there is a disjunction we replace them by a conjunction. Wherever there is an occurrence of the constant true, we replace them by constant false and wherever there is an occurrence of false we replace them by constant true.

The dual of a compound proposition is a new expression formed by switching specific logical operations. In this context, if you encounter the conjunction operator (AND), you change it to disjunction (OR), and vice versa. Constants also change their values: true becomes false, and false becomes true. These systematic replacements are what allow us to construct the dual of a given expression.

Imagine you have a switch that turns on a light when it’s pressed (AND operation). The dual would be like having a switch that turns off the light when it’s pressed (OR operation). If you treat true (light on) as false (light off), and vice versa, you are simulating how duals work. Just as flipping a switch changes the outcome, duals systematically flip the logical relationships within a proposition.

So the first part of the question is you are given some statements and you have to construct their duals. So here is one of the compound propositions. So what I have to do is remember while forming the dual I do not change the literals, the literal remains in their original form. I just have to change the conjunctions and disjunctions and the constants.

When constructing the dual of a proposition, the important note is that the individual variables (or literals) do not change—only the logical operators do. For example, in the expression A AND B, the dual would be A OR B. The literals A and B would simply remain as they are without any alteration in their form or meaning.

Consider a recipe where you have to bake cookies (AND) and cake (AND). The dual would mean making either cookies (OR) or cake (OR), but you still use the same ingredients as cookies or cake, which are your literals. You’re simply changing how you utilize them, just as in duals you’re changing the operators while keeping the components themselves intact.

Now the b part of question 7 was you to ask the following it says when is it possible that the dual of the statement is exactly equal to the original statement? I stress I am asking here exactly equal that means structurally, formula wise it is exactly the same proposition as the original proposition.

The dual of a compound proposition will be exactly equal to the original only if the statement is a single literal that is neither true nor false. This is because any additional logical operations (like conjunctions or disjunctions) will result in changes when their duals are formed. Therefore, single literals are unique cases where the dual and the original statement can be the same.

Think of a lamp that is either on or off—this is a single state (literal). If you flip the switch's state (which represents changing from true to false), the original state will be different from its dual. However, if you only think of the bulb itself without any conditions or states, you can claim that in essence, the bulb remains a bulb (literal). This illustrates why only singular literals remain unchanged in their duals.

The third part of question 7 ask you to show that if you take the dual of a statement and then again take its dual you will get back the original expression.

When you take the dual of a statement and then take the dual of that dual, you revert back to the original expression. This is because the steps to form the dual are reversible: substituting conjunctions for disjunctions and vice versa will always bring you back to the starting point. Therefore, applying the dual operation twice effectively cancels out the transformations.

Imagine a seesaw. When you push down on one side (applying the first dual), the other side elevates in response (the second dual). If you push down again on the lifted side, you effectively return to the balance point where everything started. This pattern is similar to how taking the dual of a dual returns you to the original logical proposition.

The last part of the question 7 is the following. You are given two compound propositions P and Q and they are logically equivalent it is given to you and it is also given that P and Q contains only conjunction, disjunction and negation there is no occurrence of implications and bi-implication.

If two propositions P and Q are logically equivalent, taking their duals will also produce two logically equivalent statements. This is because if they share similar truth values across all scenarios, then their transformations in the dual process will preserve that logical relationship. The equivalence of negation also maintains this scenario, reinforcing the idea that their duals operate under the same logical framework.

Consider two friends who are always in sync about their plans (logically equivalent). If one decides to switch how they communicate (taking the dual), and they both adopt the same new method of communication, they remain in harmony. This reflects how the duals of equivalent statements retain their logical compatibility and coherence.

--