Truth, Propositions, and Statements

The Big Idea

Logic begins with a simple question: what exactly is being claimed? Before we can prove, disprove, combine, or draw a conclusion from a sentence, we need to know whether it expresses a definite claim and what would make that claim true or false.

Consider the sentence “\(12\) is even.” It identifies an object, says something definite about that object, and has a truth value. That makes it a mathematical statement—or, in the language of logic, a proposition.

From small claims like this, mathematics builds definitions, theorems, proofs, and entire theories. Getting the basic vocabulary right gives us a dependable starting point for everything that follows.

Statements and Propositions

A statement is a declarative sentence that is true or false in a specified context. A proposition is the claim or meaning expressed by such a sentence.

Many introductory logic texts use statement and proposition interchangeably, and that is usually harmless. When a distinction is useful, think of the statement as the written or spoken sentence and the proposition as the idea it expresses.

For example, these sentences are worded differently:

• Four is even.
• The integer \(4\) is divisible by \(2\).

They express the same mathematical proposition. The wording is not identical, but the underlying claim is the same.

Truth Values

The truth value of a proposition is its status as true or false. In classical logic, the two truth values are commonly written as \(T\) and \(F\). Some settings use \(1\) and \(0\), but those symbols are labels here—not ordinary numerical measurements.

Notice that a false statement is still a statement. Being a proposition does not mean being correct; it means making a definite claim that can be evaluated.

True, False, Known, and Unknown

Truth is not the same as certainty, confidence, or knowledge. A proposition may have a truth value even when a particular person has not discovered or checked it.

Suppose someone asks whether

\[ 9{,}876{,}543\cdot 1{,}234{,}567 \]

is even. You may not know the answer immediately, but the claim is not halfway true or temporarily without meaning. The product is either even or odd. In fact, it is odd because both factors are odd.

It helps to keep the categories separate:

• True or false describes the proposition.
• Known or unknown describes our information about it.
• Proved or not yet proved describes the justification currently available to us.

A proof does not make a proposition true by persuasion. It gives a valid reason for accepting the proposition from stated assumptions.

Truth Lives in a Context

Mathematical statements depend on definitions, domains, and assumptions. A sentence can sound complete while still hiding important context.

“The angles of a triangle sum to \(180^\circ\)” is true in Euclidean geometry. On a curved surface, a different geometry may give a different result. The sentence is not useless; it simply belongs to a particular mathematical setting.

The domain matters too. The statement

\[ x^2+1=0\text{ has a solution} \]

is false if \(x\) must be real and true if \(x\) may be complex. A careful reader asks, “Which objects are allowed?” before assigning a truth value.

Definitions supply context as well. Whether \(0\) counts as a natural number depends on the convention being used. Good mathematical writing states or clearly inherits the convention instead of making the reader guess.

What Is Not a Proposition?

Not every grammatical sentence expresses a proposition. Questions and commands do not assert that something is the case, and vague language may not provide definite truth conditions.

Often we can repair an incomplete sentence. “This integer is huge” might become “This integer is greater than one million.” Precision turns a loose impression into a claim with recognizable truth conditions.

Open Sentences Need More Information

The equation

\[ x+3=8 \]

looks like a claim, but its truth depends on \(x\). It is an open sentence, also called a predicate. Assigning \(x=5\) makes it true; assigning \(x=2\) makes it false.

An open sentence becomes a proposition when every free variable is assigned a value or governed by a quantifier:

• \(5+3=8\) is a true proposition.
• \(\exists x\in\mathbb{Z}\,(x+3=8)\) is a true proposition.
• \(\forall x\in\mathbb{Z}\,(x+3=8)\) is a false proposition.

The first uses substitution. The other two use the quantifiers “there exists” and “for every” to make complete claims about the integer domain.

Simple and Compound Propositions

A proposition treated as a single unit is called a simple or atomic proposition. Logical connectives combine propositions into compound propositions.

Let

• \(p\): “\(12\) is even,” and
• \(q\): “\(12\) is divisible by \(3\).”

Here \(p\) and \(q\) stand for whole propositions. They are often called proposition variables. They do not stand for ordinary numbers.

In standard mathematical logic, “or” is inclusive unless stated otherwise: \(p\lor q\) allows \(p\), \(q\), or both to be true.

How Compound Truth Works

The truth value of a compound proposition depends on two things: the truth values of its parts and the connective joining them.

Since both \(p\) and \(q\) above are true, \(p\land q\) is true: \(12\) is even and divisible by \(3\). The negation \(\neg p\) is false because “\(12\) is not even” contradicts the true proposition \(p\).

Ordinary language sometimes leaves connectives implicit or uses them flexibly. Formal logic removes that uncertainty by assigning each connective an exact truth condition. Later lessons can organize these conditions in truth tables.

Negation Must Be Exact

The negation of a proposition says precisely that the original proposition is not true. A good negation changes the truth value without changing the subject or making a stronger claim than necessary.

For example:

• Original: “Every integer is positive.”
• Negation: “At least one integer is not positive.”

The negation is not “No integer is positive.” That sentence says much more than is needed to deny the original.

Similarly:

• The negation of \(x=7\) is \(x\ne7\).
• The negation of \(x\gt7\) is \(x\le7\).
• The negation of “some object has property \(P\)” is “no object has property \(P\).”

Careful negation becomes especially important in proof by contradiction, quantified statements, and the analysis of definitions.

Truth and Proof

In mathematics, a proof is a logically valid chain of reasoning from definitions, assumptions, axioms, and previously established results. It explains why a proposition must be true within the stated framework.

Different kinds of propositions call for different kinds of justification:

• A numerical statement may be checked by exact calculation.
• An existential statement may be proved by producing one valid example.
• A universal statement requires reasoning that covers every object in its domain.
• A universal statement may be disproved by one counterexample from the domain.

Checking many examples can provide evidence, but it does not usually prove a universal claim. No matter how many even integers you test, the claim “every even integer greater than \(2\) is prime” is refuted by the single counterexample \(4\).

Truth Is Not Validity

A proposition is true or false. An argument is valid or invalid. These labels answer different questions.

• Truth asks whether a claim is correct in its context.
• Validity asks whether the conclusion must follow if the premises are true.

Consider this argument:

1. If an integer is divisible by \(4\), then it is even.
2. \(12\) is divisible by \(4\).
3. Therefore, \(12\) is even.

The argument is valid because its form does not allow true premises and a false conclusion. Its premises are also true, so the argument is sound. A sound argument is valid and has true premises.

An argument can have a true conclusion for a bad reason, so a correct final answer alone does not guarantee valid reasoning. Logic pays attention to the route as well as the destination.

Mathematical Truth and Real-World Models

Pure mathematical propositions are evaluated within definitions and assumptions. Applied mathematics adds another layer: the model must also represent the real situation well enough for the purpose at hand.

A calculation can be flawless while the model uses unrealistic assumptions. For example, a formula may correctly predict motion under the assumption of no air resistance, yet differ from a physical experiment in which air resistance matters.

It is useful to ask two separate questions:

1. Does the conclusion follow correctly from the mathematical model?
2. Are the model and its assumptions appropriate for the situation?

This distinction keeps mathematical correctness from being confused with real-world accuracy.

Friendly Habits for Reading Claims

When you meet a mathematical sentence, work through these questions:

1. What exact claim is being made? Restate it in your own words.
2. Is it declarative? Separate statements from questions, commands, and expressions.
3. Are all objects identified? Resolve pronouns, variables, and references.
4. What is the domain? Decide which objects the claim concerns.
5. Which definitions and assumptions are active?
6. Is the proposition simple or compound? Find connectives such as and, or, not, and if…then.
7. What would make it true or false? State its truth conditions.
8. What kind of support is needed? Calculation, example, proof, or counterexample?
9. Am I evaluating a proposition or an argument? Use truth for propositions and validity for arguments.

You do not need to answer every question aloud. With practice, they become a quick mental checklist that makes complicated reasoning easier to untangle.

Common Confusions

Working Summary

A proposition is a definite claim with a truth value, and a statement is a sentence that expresses such a claim. In classical logic, propositions are true or false within a context supplied by definitions, domains, and assumptions.

Open sentences become propositions through assignment or quantification. Logical connectives build compound propositions, proofs justify mathematical claims, and validity describes whether a conclusion follows from premises. These distinctions give mathematical reasoning its precision.

Check Your Understanding