Get AI summaries of any video or article — Sign up free
Start Learning Logic 1 | Logical Statements, Negations and Conjunction [dark version] thumbnail

Start Learning Logic 1 | Logical Statements, Negations and Conjunction [dark version]

5 min read

Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

A proposition is a declarative statement with a definite truth value (true or false) once meanings and definitions are fixed.

Briefing

Logic in mathematics starts with propositions: meaningful declarative statements that have a definite truth value—either true or false. A proposition must be unambiguous enough that, once the relevant definitions are agreed on, its truth can be evaluated. “Mars is a planet” becomes a proposition once “Mars” and “planet” are defined; “Pluto is a planet” is also a proposition under the same agreement, but it evaluates to false. Mathematical examples are often cleaner because definitions are built in: “one plus one equals two” is true once the meanings of the numerals and symbols are fixed, while “the number five is smaller than the number two” is a proposition that evaluates to false.

Not every sentence qualifies. “Good morning” lacks a well-defined truth value, so it is not a proposition. Likewise, a sentence that looks mathematical can fail to be a proposition if it contains an unfixed variable. For instance, “I have a variable X plus 1 and this is equal to 1” does not have a single truth value until X is assigned a specific value; once X is fixed, the statement becomes a proposition. Such variable-dependent constructions are common in mathematics, and they’re flagged as “predicates” (pretty kits in the transcript).

Once propositions are in place, logic builds new propositions using logical operations. The first operation introduced is negation. For a proposition A, the negation is written with a symbol in front of A and read as “not A.” Negation flips the truth value: if A is true, not A is false; if A is false, not A is true. The transcript emphasizes that correct negation is determined by a truth table, which lists all possible truth values for the input and the corresponding output. A key subtlety is that negation must be defined across both possible “worlds,” not just the one you already know. For example, if A is “2 + 2 = 5,” then A is false; but not A must still be false in the hypothetical world where A would be true. The truth table captures both cases.

The next operation is conjunction, combining two propositions A and B using a wedge symbol read as “A and B.” Conjunction is true only when both A and B are true simultaneously. With two inputs, the truth table expands from two rows to four, reflecting all combinations of truth values. The transcript also offers an intuitive circuit analogy: treat A and B as switches, where “true” means the switch is on and “false” means it’s off. The lamp (the output of A and B) turns on only when both switches are on; any case where at least one switch is off yields false. The takeaway is that logical operations are defined precisely through truth tables, ensuring unambiguous foundations for later work in mathematics.

Cornell Notes

The foundation of mathematical logic is the proposition: a meaningful declarative statement with a definite truth value (true or false). Sentences like “Good morning” fail because they don’t have a fixed truth value, and variable-containing statements aren’t propositions until the variable is fixed. Logical operations create new propositions from existing ones, and their behavior is defined using truth tables. Negation (“not A”) flips truth values, but it must be specified for both possible cases. Conjunction (“A and B”) is true only when both A and B are true, which produces a four-row truth table for the two inputs.

What makes a sentence a proposition in this logic framework?

A proposition is a meaningful declarative sentence whose truth value is well-defined as either true (2) or false (fault). It must be unambiguous once relevant definitions are agreed on—e.g., “Mars is a planet” is evaluable after “Mars” and “planet” are defined. By contrast, “Good morning” has no fixed truth value, so it’s not a proposition. Also, statements with unfixed variables (like “X + 1 = 1” when X is not specified) don’t have a single truth value until X is assigned.

Why can’t negation be defined using only the case you already know?

Negation must be defined across both possible truth scenarios for A. The transcript’s example uses A: “2 + 2 = 5.” Even though A is false in the real world, the negation “2 + 2 is not equal to 5” must be defined so that it would be false in the hypothetical world where A would be true. Truth tables enforce this by listing both input cases and the corresponding output for not A.

How does the truth table define negation?

A truth table for negation lists all possible truth values of A (true or false) and outputs the opposite. If A is true, not A is false; if A is false, not A is true. The transcript illustrates this with the idea of switching the truth value and with examples like inserting “not” into a sentence (“The wine bottle is full” becomes “The wine bottle is not full”).

What does conjunction (“A and B”) require to be true?

Conjunction is true only when both A and B are true simultaneously. If either A is false or B is false (or both), then A and B is false. With two propositions, there are four possible combinations of truth values, so the truth table has four rows. The transcript’s circuit analogy matches this: both switches must be on for the lamp to turn on.

How do the circuit and switch analogy map to conjunction?

The analogy treats each proposition as a switch: “true” corresponds to the switch being on, and “false” corresponds to it being off. The lamp represents the conjunction output. The lamp turns on (true) only when both switches are on (A and B are both true). If at least one switch is off, the lamp stays off (false).

Review Questions

  1. What conditions must a statement meet to qualify as a proposition, and why do variable-dependent sentences require additional information?
  2. Using truth-table logic, what are the outputs of not A for both possible truth values of A?
  3. For two propositions A and B, list the four input combinations and identify exactly when A and B is true.

Key Points

  1. 1

    A proposition is a declarative statement with a definite truth value (true or false) once meanings and definitions are fixed.

  2. 2

    Real-world sentences can become propositions only after agreeing on what terms refer to; otherwise truth may be unclear.

  3. 3

    Sentences without a fixed truth value (like “Good morning”) are not propositions.

  4. 4

    Statements containing unfixed variables are not propositions until the variables receive specific values.

  5. 5

    Negation (“not A”) flips truth values and must be defined for both possible cases using a truth table.

  6. 6

    Conjunction (“A and B”) is true only when both A and B are true, producing a four-row truth table for two inputs.

  7. 7

    Truth tables provide unambiguous definitions for logical operations, avoiding mistakes from considering only one case.

Highlights

Negation must be specified across both possible truth scenarios for A, not just the case that happens to be true in the current situation.
Conjunction is true only in the single case where both inputs are true; every other combination yields false.
Variable-containing statements don’t count as propositions until the variable is fixed, even if they look mathematical at first glance.
Truth tables are the mechanism that turns informal logic into precise, unambiguous definitions.

Topics

  • Propositions
  • Negation
  • Conjunction
  • Truth Tables
  • Logical Operations