7.6.1. Using Resolution for Validity

To prove that a set of logical operators is functionally complete, we must show that any compound proposition can be represented using only those operators. For example, using the operators conjunction (AND), disjunction (OR), and negation (NOT), we can transform any expression involving implications and bi-implications into an expression using only these operators.

A functionally complete set of logical operators can express any logical statement. When we have compound propositions with implications (like 'p → q'), we can use the equivalence 'p → q is the same as ¬p ∨ q' to transform the implication into disjunction and negation. Moreover, for bi-implications (like 'p ↔ q'), we can decompose it into conjunctions of implications, effectively allowing us to represent everything in terms of conjunctions, disjunctions, and negations, thereby demonstrating functional completeness.

Think of this like a toolbox that contains all the tools needed to fix any problem. Just like how you can fix a bicycle, car, or a computer with the right tools, you can represent any logical statement with the right operators. If you only have a wrench (negation) and a screwdriver (disjunction), you can still fix many things as long as you use them creatively together.

To show that conjunction (AND) can be expressed with just negation (NOT) and disjunction (OR), we can use the logical equivalence: p ∧ q is equivalent to ¬(¬p ∨ ¬q). This allows us to represent any conjunction purely with disjunction and negation.

By using De Morgan's Law, we can manipulate the expression involving conjunctions into disjunctions. For example, if we start with 'p ∧ q', we can first rewrite it as '¬(¬p ∨ ¬q)'. Essentially, this shows that if we know both p and q must be true, it can also be represented as saying it's not the case that either p or q is false, thus demonstrating how conjunction is reducible to just negation and disjunction.

Imagine you are trying to determine if a certain event occurs when both conditions must be met, like 'You can go outside if it is not raining AND you have finished your homework.' In a way, it can also be said that 'It is not true that it is either raining OR you haven't finished your homework.' This illustrates how you can express the same condition using different logical constructs.

Similarly, we can demonstrate that negation (NOT) and conjunction (AND) can express disjunction (OR). The equivalence can be shown as: p ∨ q is equivalent to ¬(¬p ∧ ¬q). This allows every logical statement to be constructed using just these two operators.

When we change our approach to disjunction, we can express 'p ∨ q' as '¬(¬p ∧ ¬q)'. This shows that if p or q must be true, it is logically equivalent to stating it is not the case that both p and q are false. With this transformation, we can illustrate that with just negation and conjunction, we can maintain the logical relationships inherent in disjunction.

Consider a situation where you can go to a party if either your friend invites you OR you finish your chores. Saying 'You can’t go if neither happens' conveys the same sentiment. You can represent the same logic using just negative conditions (not happening) and positive actions (working hard).

The findings about functional completeness imply that any logical statement can be evaluated using various configurations of negation, conjunction, and disjunction, making these operators exceptionally powerful in logical proofs and reasoning.

The ability to represent logical operations solely through a limited set of operations, namely negation, conjunction, and disjunction, underpins many logical constructs and problems. This means any logic puzzle or logical expression can ultimately be resolved using these three foundational elements, demonstrating their essential nature in mathematical logic and computer science.

Think of it as using LEGO blocks: while you have a million different kinds of blocks (logical operators), you can actually build every single structure (logical statement) using just a few basic types of blocks! This idea is fundamental in computing, where complex commands can be simplified down to binary operations.

--