91Ó°ÊÓ

Logical duality is a principle in logic where operations are swapped to form a new expression, known as the 'dual'. This involves switching 'and' (\textbf{conjunction} \( \wedge \)) with 'or' (\textbf{disjunction} \( \vee \)), and replacing 'true' (\textbf{T}) with 'false' (\textbf{F}) and vice versa. This concept helps in simplifying logical statements and verifying logical equivalence. For example, if we start with the proposition \( p \vee \eg q \) and find its dual, we swap \( \vee \) with \( \wedge \), resulting in the dual proposition \( p \wedge \eg q \). The truth values remain unchanged unless specified. Understanding duality helps in mastering other logical operations and simplifies complex logical expressions.

A compound proposition is a statement formed by combining one or more propositions using logical connectives such as \( \wedge \) (and) and \( \vee \) (or). Each individual statement within a compound proposition is called a \textbf{simple proposition}. For instance, \( p \vee \eg q \) combines the simple propositions \( p \) and \( \eg q \). Compound propositions can be intricate, with multiple layers of connectives, such as \( p \wedge (q \vee (r \wedge \mathbf{T})) \). By breaking down these compound statements and ensuring we understand each part, we can manipulate and analyze them effectively. Recognizing the structure of compound propositions aids in applying operations like finding duals or performing logical equivalences.

Logical connectives are symbols or words used to connect simple propositions to form compound propositions. The most common logical connectives are:

• Conjunction (and, \( \wedge \)): True if both connected propositions are true.
• Disjunction (or, \( \vee \)): True if at least one connected proposition is true.
• Negation (not, \( \eg \)): Inverts the truth value of the proposition.
• Implication (if... then, \( \rightarrow \)): True unless a true proposition implies a false one.
• Biconditional (if and only if, \( \leftrightarrow \)): True if both propositions have the same truth value.

Using these connectives, we can build complex logical expressions and analyze their truth values. Mastering logical connectives is vital for understanding logical statements and their relationships.

Truth values indicate whether a proposition is true or false. In classical logic, there are two truth values:

• True (\textbf{T}): Indicates the proposition is true.
• False (\textbf{F}): Indicates the proposition is false.

All propositions, simple or compound, have a truth value. For example, in the proposition \( p \vee \eg q \), if \( p \) is true and \( q \) is false, the entire proposition's truth value is true because the disjunction requires only one true member. When finding the dual of a proposition, swapping \textbf{T} and \textbf{F} can help visualize the change in truth values. Understanding truth values is crucial for evaluating logical statements and their correctness.