Is 'This Sentence Is False' a Proposition? If Not, Why?

Look at the sentence written below the break, then try to decide its truth value.

"This sentence is false."

Try "true" first. If the sentence is true, then what it says is the case — so the sentence is false. True forces false. Now try "false." If the sentence is false, then its claim ("this sentence is false") is not the case — so the sentence is not false, i.e. true. False forces true. Each assignment immediately flips to the other. There is no stable resting place.

You are not misreading it. This sentence — called the liar sentence — genuinely refuses to be either true or false. It is the most famous sentence in logic, and it is worth understanding because it marks the precise boundary of what mathematical logic is willing to talk about.

The rule you already learned

A proposition is a declarative sentence that is either true or false, but not both, and not neither. That definition has three quiet requirements:

Truth-valued. The sentence must have some truth value — T or F.
Unique. The truth value must be a single one of them, not both.
Determinate. The truth value must be fixed by the meaning of the sentence, not left dangling.

Why all three matter: propositional logic builds truth tables by substituting T or F for each component proposition. If a sentence has no truth value, or two truth values, or a value that flips depending on which you guess first, you cannot place it into a truth-table row without breaking the row.

What goes wrong with the liar sentence

Call the liar sentence L. Suppose you try to put L into a truth table.

Assume L is T. The sentence claims "L is false." If L is true, its claim holds — so L is false. Contradiction with the assumption.
Assume L is F. Then its claim "L is false" is false, which means L is not false — i.e. L is true. Contradiction with the assumption.

Both candidate assignments produce a contradiction. There is no third option (the law of the excluded middle only gives you T or F). So L cannot satisfy the definition of a proposition — it has no consistent truth value at all.

It is not that we do not know whether L is true or false. It is that the two possibilities structurally cannot hold. Knowledge is not the issue; the sentence itself is malformed.

Self-reference is the culprit, not negation

A sentence like "this sentence has five words" is a proposition. It talks about itself, but only about a harmless property (word count), and it is straightforwardly false — it has six words. Self-reference alone does not break things.

The damage happens when a sentence refers to its own truth value through negation. Any construction of the form

L: \quad L \text{ is false}

is a fixed point of the negation operator — a sentence whose truth value must equal the negation of itself. The equation x = \lnot x has no solution in \{T, F\}, so no consistent truth value can be assigned.

Why the equation has no solution: plug in T, you need T = \lnot T = F — impossible. Plug in F, you need F = \lnot F = T — also impossible. There is no x in \{T, F\} with x = \lnot x.

A live exploration

The interactive below lets you try each assignment and watch the contradiction appear. Drag the dot to flip the assumed truth value of L, and the readout shows what the sentence then forces you to conclude.

assume L is:

Whichever truth value you pin to $L$, the sentence immediately flips it. There is no fixed point in $\{T, F\}$, so $L$ is not a proposition.

So what is the liar sentence?

It is a grammatically well-formed English sentence whose content violates the rules of the truth-value game. In the language of modern logic, it is called ungrounded or truth-value-less — it simply does not enter the domain to which the predicates "true" and "false" apply.

That does not make it nonsense. "What is the capital of India?" is not nonsense either, but it is not a proposition — it is a question. The liar sentence is a declarative look-alike that fails the specific test of having a stable truth value. Propositional logic politely excludes it from the start.

Why mathematicians do care, though

The liar sentence became foundational because it showed that a naive attempt to let a language talk freely about its own truth values is inconsistent. Alfred Tarski proved, in the 1930s, that no sufficiently expressive language can contain its own truth predicate without producing a liar. The repair is to separate "object language" (where you talk about mathematics) from "metalanguage" (where you talk about whether object-language statements are true). Each stays consistent by refusing to define truth for itself.

Your school syllabus will not test you on Tarski's theorem, but the moral is built into the definition of a proposition: truth values apply to sentences that describe something other than their own truth value. Sentences that loop back on themselves and negate themselves are excluded by design.

A cleaner cousin — the truth-teller

Consider T: "This sentence is true." This one is the mirror image of the liar. If T is true, then what it says is the case — T is true. Consistent. If T is false, then what it says is not the case — T is not true, i.e. false. Also consistent.

Both assignments work, but neither is forced. The sentence has two equally valid truth values depending on which you pick — which violates the uniqueness requirement. So the truth-teller is also not a proposition, for a different reason: it is underdetermined rather than overdetermined.

The liar is a contradiction machine. The truth-teller is a coin-flip machine. Neither fits the definition.

The reflex to keep

When you see a candidate proposition, ask three quick questions:

Does it make a declaration (not a question, not a command)?
Does its truth value depend on anything undefined, or on its own truth value?
Could both T and F pass the substitution test, or could neither?

If the answer to the first is yes and to the others is no, you have a proposition. The liar sentence fails the second and third. "This sentence is in English" passes all three (T). "Close the door" fails the first (not declarative). "x > 3" fails the second (depends on x).

The liar is valuable precisely because it is the cleanest example of a sentence that looks like a proposition, sounds like a proposition, and is not one. Logic is strict about its admission rules, and this sentence stands at the door as the permanent reminder.