-
Table of Contents
- Introduction
- AND Operation
- Mathematical Form
- C++ Form and Examples
- OR Operation
- Mathematical Form
- C++ Form and Examples
- NOT Operation
-
Mathematical Form
-
C++ Form and Examples
- XOR Operation
- Mathematical Form
- C++ Form and Examples
- NOR Operation
-
Mathematical Form
-
C++ Form and Examples
- NAND Operation
-
Mathematical Form
-
C++ Form and Examples
- Conclusion
1. Introduction
In the field of computer programming, logical operators are core tools for controlling program flow and implementing conditional judgments, with their logical principles rooted in mathematical logic. This article systematically organizes the commonly used logical operators (AND, OR, NOT, XOR, NOR, NAND) in their mathematical notation, corresponding to their expressions in the C++ programming language, and analyzes their usage with practical examples to help readers understand the characteristic that “the essence of logic is common, while the forms adapt to the scenarios.”
2. AND Operation
The core logic of the AND operation is that “all conditions must be true for the result to be true”; it is the fundamental operation for judging whether multiple conditions are “simultaneously satisfied”.
2.1 Mathematical Form
- Symbol: Represented by “∧” (read as “and”)
- Logical Rule: For two propositions A and B, A ∧ B is true only when both A and B are true; in all other cases (A true B false, A false B true, A false B false), the result is false.
- Truth Table:
A B A ∧ B True True True True False False False True False False False False
2.2 C++ Form and Examples
- Symbol: Represented by “&&” (double ampersand)
- Characteristics: Short-circuit evaluation — if the first condition is false, subsequent conditions are not evaluated (since the overall result is already determined to be false), which can improve program efficiency.
- Example: Check if two integers satisfy the conditions of “greater than 3” and “less than 15” simultaneously
#include <iostream>using namespace std;int main() { int num1 = 5; int num2 = 10; // Check if num1 > 3 and num2 < 15, execute code block when both conditions are true if (num1 > 3 && num2 < 15) { cout << "Both conditions are true" << endl; // This output will be executed } return 0;}- Output: Both conditions are true
- Analysis: num1=5 satisfies num1>3 (true), num2=10 satisfies num2<15 (true), thus the “&&” operation result is true, executing the code inside the if statement.
3. OR Operation
The core logic of the OR operation is that “at least one condition must be true for the result to be true”; it is used to judge scenarios where “satisfying any one condition is sufficient”.
3.1 Mathematical Form
- Symbol: Represented by “∨” (read as “or”)
- Logical Rule: For two propositions C and D, if either C or D is true, C ∨ D is true; only when both C and D are false is the result false.
- Truth Table:
C D C ∨ D True True True True False True False True True False False False
3.2 C++ Form and Examples
- Symbol: Represented by “||” (double vertical bar)
- Characteristics: Short-circuit evaluation — if the first condition is true, subsequent conditions are not evaluated (since the overall result is already determined to be true).
- Example: Check if “age is greater than 18” or “is a student”, satisfying any one condition meets the requirement
#include <iostream>using namespace std;int main() { int age = 20; bool isStudent = true; // If age > 18 or isStudent is true, execute code block if (age > 18 || isStudent) { cout << "Meets the requirement" << endl; // This output will be executed } return 0;}- Output: Meets the requirement
- Analysis: age=20 satisfies age>18 (true), thus the “||” operation directly returns true, no need to check isStudent, executing the code inside the if statement.
4. NOT Operation
The core logic of the NOT operation is to “negate a single condition”; it is a fundamental tool for “negating scenarios” in logical judgments.
4.1 Mathematical Form
- Symbol: Represented by “¬” (read as “not”)
- Logical Rule: Negating a single proposition E, if E is true, then ¬E is false; if E is false, then ¬E is true.
- Truth Table:
E ¬E True False False True
4.2 C++ Form and Examples
- Symbol: Represented by “!” (exclamation mark)
- Characteristics: Only applies to a single boolean value or conditional expression, with higher precedence than AND and OR operations.
- Example: Check “is it raining”; if not raining, output “can go out to play”
#include <iostream>using namespace std;int main() { bool isRaining = false; // Negate isRaining, if true execute code block if (!isRaining) { cout << "It is not raining, can go out to play" << endl; // This output will be executed } return 0;}- Output: It is not raining, can go out to play
- Analysis: isRaining is false, after negation “!” it becomes true, thus executing the code inside the if statement.
5. XOR Operation
The core logic of the XOR operation is that “the two conditions must differ in truth value for the result to be true”; it is commonly used in scenarios such as “judging differences” and “data encryption”.
5.1 Mathematical Form
- Symbol: Represented by “⊕” (read as “XOR”)
- Logical Rule: For two propositions F and G, when F and G have different truth values (one true, one false), F ⊕ G is true; when F and G have the same truth value (both true or both false), the result is false.
- Truth Table:
F G F ⊕ G True True False True False True False True True False False False
5.2 C++ Form and Examples
- Symbol: Represented by “^” (caret symbol, note the distinction from “power” in mathematics)
- Characteristics: Can be used for logical XOR of boolean values as well as for “bitwise XOR” of integers (performing XOR operation on each binary bit separately).
- Example 1: Boolean XOR (checking if results differ)
#include <iostream>using namespace std;int main() { bool result1 = true; bool result2 = false; // Check if result1 and result2 differ if (result1 ^ result2) { cout << "Results differ" << endl; // This output will be executed } return 0;}- Output: Results differ
- Analysis: result1 is true, result2 is false, differing truth values, thus the “^” operation result is true, executing the code inside the if statement.
- Example 2: Bitwise XOR of integers (calculating binary differences)
#include <iostream>using namespace std;int main() { int x = 5; // Binary: 0101 int y = 3; // Binary: 0011 int z = x ^ y; // Bitwise XOR: 0101 ^ 0011 = 0110 (decimal 6) cout << "5 ^ 3 = " << z << endl; return 0;}- Output: 5 ^ 3 = 6
- Analysis: When XORing integers, each binary bit follows the rule “same is 0, different is 1”, resulting in 6 in decimal.
6. NOR Operation
The core logic of the NOR operation is to “first perform the OR operation, then negate the result”; it is the negation of the OR operation, and the result is true only when “all conditions are false”.
6.1 Mathematical Form
- Symbol: Represented by “↓” (read as “NOR”, also known as “Pierce arrow”)
- Logical Rule: For two propositions H and I, first calculate H ∨ I (OR operation), then negate the result, i.e., H ↓ I = ¬(H ∨ I). The result is true only when both H and I are false; in all other cases, it is false.
- Truth Table:
H I H ∨ I H↓I (¬(H∨I)) True True True False True False True False False True True False False False True True
6.2 C++ Form and Examples
- Implementation: C++ does not have a dedicated NOR operator, it must be implemented using “OR operation (||) + NOT operation (!)”, i.e., !(a || b).
- Example: Check if both conditions are “false”; if so, output “NOR operation result is true”
#include <iostream>using namespace std;int main() { bool condition1 = false; bool condition2 = false; // First perform OR operation, then negate if (!(condition1 || condition2)) { cout << "NOR operation result is true" << endl; // This output will be executed } return 0;}- Output: NOR operation result is true
- Analysis: Both condition1 and condition2 are false, condition1 || condition2 results in false, after negation “!” it becomes true, executing the code inside the if statement.
7. NAND Operation
The core logic of the NAND operation is to “first perform the AND operation, then negate the result”; it is the negation of the AND operation, and the result is false only when “all conditions are true”.
7.1 Mathematical Form
- Symbol: No dedicated symbol, the logical expression is “¬(J ∧ K)” (read as “NAND”)
- Logical Rule: For two propositions J and K, first calculate J ∧ K (AND operation), then negate the result. The result is false only when both J and K are true; in all other cases, it is true.
- Truth Table:
J K J ∧ K ¬(J ∧ K) (NAND) True True True False True False False True False True False True False False False True
7.2 C++ Form and Examples
- Implementation: C++ does not have a dedicated NAND operator, it must be implemented using “AND operation (&&) + NOT operation (!)”, i.e., !(a && b).
- Example: Check if both conditions are “not all true”; if so, output “NAND operation result is true”
#include <iostream>using namespace std;int main() { bool value1 = true; bool value2 = false; // First perform AND operation, then negate if (!(value1 && value2)) { cout << "NAND operation result is true" << endl; // This output will be executed } return 0;}- Output: NAND operation result is true
- Analysis: value1 is true, value2 is false, value1 && value2 results in false, after negation “!” it becomes true, executing the code inside the if statement.
8. Conclusion
The correspondence and core logic of commonly used logical operators in mathematics and C++ are summarized in the following table:
| Logical Operation | Mathematical Symbol | C++ Symbol / Implementation | Core Logic |
| AND | ∧ | && | All true then true, otherwise false |
| OR | ∨ | || | One true then true |
| NOT | ¬ | ! | Negate, true becomes false, false becomes true |
| XOR | ⊕ | ^ | Different truth values then true, same then false |
| NOR | ↓ | All false then true, otherwise false | |
| NAND | ↑ | All true then false, otherwise true (negation of AND) |
Logical operators are an important bridge connecting mathematical logic and programming practice: mathematical symbols focus on “concise expression of logical relationships”, while C++ symbols focus on “adapting to computer syntax and efficiency”. Mastering the correspondence between the two not only deepens the understanding of the essence of logic but also allows for precise control of conditional judgments in programming, optimizing program flow, and laying a solid foundation for further studies in algorithms, data structures, circuit design, and other fields.