At its heart, mathematical logic is a system for clear thinking. It gives us a precise language to talk about whether statements are true or false, and how we can build complex arguments from simple pieces. The most basic piece is called a proposition.

Think of propositions as simple facts. "It is raining" is a proposition. "2 + 2 = 4" is also a proposition. However, "What time is it?" is not a proposition because it's a question. "This statement is false" is also not a proposition, as it creates a paradox.

Once we have these basic statements, we need a way to connect them. In English, we use words like "and," "or," and "if...then." In logic, we use symbols called logical connectives. They are the grammar of our logical language.

Let's meet the five most common connectives. We'll use the variables $p$ and $q$ to stand in for any proposition.

1. Negation (NOT): This simply flips the truth value of a proposition. The symbol is $¬$. So, if $p$ is "It is sunny," then $¬p$ means "It is not sunny."

2. Conjunction (AND): This connects two propositions and is true only if both are true. The symbol is $∧$. If $p$ is "The coffee is hot" and $q$ is "The mug is red," then $p ∧ q$ means "The coffee is hot and the mug is red."

3. Disjunction (OR): This connects two propositions and is true if at least one of them is true. The symbol is $∨$. Using the same examples, $p ∨ q$ means "The coffee is hot or the mug is red." This statement is true if the coffee is hot, if the mug is red, or if both are true.

4. Implication (IF...THEN...): This shows a relationship where the truth of the first proposition guarantees the truth of the second. The symbol is $→$. The statement $p → q$ is read as "If $p$, then $q$." For example: "If it is raining, then the ground is wet."

5. Biconditional (IF AND ONLY IF): This is a stronger connection, stating that two propositions have the exact same truth value. The symbol is $↔$. The statement $p ↔ q$ means "$p$ if and only if $q$." For example: "You can vote if and only if you are registered."

To see how these connectives work in every possible scenario, we use a tool called a truth table.

Truth tables are powerful because they remove all ambiguity. For any logical statement, no matter how complex, we can build a truth table to find every case where it is true or false. This is the foundation of how computers make decisions.

Propositional logic is great for combining complete statements. But what if we want to talk about the properties of things or make general claims? For that, we need to upgrade to predicate logic.

Predicate logic breaks propositions down further. Consider the statement "Socrates is a man." In predicate logic, "is a man" is the predicate—a property that something can have. "Socrates" is the subject. We could write this as $Man(Socrates)$. The predicate $Man(x)$ is a template; it becomes a proposition once we plug something in for $x$.

This new level of detail allows us to use quantifiers to talk about entire groups of things.

This asserts that there is not a single human who is not mortal.

This only requires us to find one black cat for the statement to be true. Quantifiers give our logical language incredible power, allowing us to express complex mathematical ideas and form structured arguments.

The final step is to use this language to build valid arguments. In logic, an argument consists of a set of propositions called premises, which lead to another proposition called the conclusion. The process of reaching that conclusion is called logical inference.

A classic example is called Modus Ponens.

Let's put it into words:

• Premise 1: If it is raining ($p$), then the streets are wet ($q$).
• Premise 2: It is raining ($p$).
• Conclusion: Therefore, the streets are wet ($q$).

This argument is valid because if the premises are true, the conclusion must also be true. Mathematical proofs are essentially long chains of these valid inferences, starting from a set of axioms (assumed truths) and arriving at a new, proven conclusion.

Now, let's test your understanding of these logical concepts.

These building blocks—propositions, connectives, quantifiers, and rules of inference—form the backbone of mathematical reasoning. They allow us to construct arguments with precision and certainty, ensuring that our conclusions follow logically from our starting points.