On this concept: Formula

Not sure which lesson to do first? Find your level and get a plan →

Math · Sets & Logic · Grade 9-12

Consistency (Meta)

Consistency means a set of statements has no internal contradiction — they can all hold simultaneously.

A set of statements {P1,P2,…,Pn} is consistent ⇔ P1∧P2∧⋯∧Pn⊬⊥ (equivalently, some assignment or model makes every Pi true)

Quick Answer

Consistency means a set of statements has no internal contradiction — they can all hold simultaneously. You check it whenever you are handed several conditions at once, such as the constraints in a word problem, the rules of a game or the equations of a system, before you reason from them. A single example that satisfies every statement proves the set is consistent; a group of statements that cannot be true together proves it is not.

Why This Matters

From an inconsistent set of statements you can derive anything at all, so every conclusion drawn from it is worthless. That is why a system of equations with no solution, a timetable that puts one teacher in two rooms, or a contract with clashing clauses has to be caught early. Checking consistency first tells you whether there is anything to solve.

Intuitive Explanation

A friend sets a puzzle: 'I am thinking of a number greater than 5, less than 10, and even.' You can hunt for it, and 6 and 8 both work, so the clues are consistent. Change the last clue to 'and greater than 12' and no search will ever succeed: the first two clues trap the number between 5 and 10, the new clue demands more than 12, and the three can never all be true. The set is inconsistent, even though each clue on its own is perfectly reasonable.

That last point is the one people miss. Consistency belongs to the whole set, not to each statement. The equations x+y=4 and x+y=6 each have infinitely many solutions, but together they demand that one sum be both 4 and 6, so the pair has none. To show a set is consistent, exhibit one example that satisfies everything. To show it is inconsistent, combine statements until a clash such as 4=6 appears.

Consistency is easy to mix up with completeness and with validity. Completeness asks whether every true statement can be proved, which is a different question. Validity asks whether a conclusion follows from premises; an argument can be valid even when its premises contradict each other, which is exactly why inconsistent premises are dangerous: they validly lead to any conclusion at all.

Think of it like this. A set of statements is like the rule sheet of a board game. If one rule says 'the youngest player moves first' and another says 'the oldest player moves first', the game cannot start, however sensible each rule looks alone. A mathematical contradiction is worse than a stalled game, though: it lets you prove any statement whatsoever.

Core idea. A set of statements is consistent if they can all be true at once — no contradiction can be derived from them.


When to Use

Check consistency when a problem gives several conditions at once (constraints, rules, axioms, equations) and asks whether a solution exists, or whether the conditions can all hold. Try to build one example that meets every condition; if that fails, combine conditions to look for a clash such as 0=1, or x>5 alongside x<3. Whether a conclusion follows from premises is a question of validity; whether every truth is provable is completeness.

Tip. Ask: Can every statement in this set be true at the same time without forcing a contradiction?

How to Recognize It

Before reasoning from a list of conditions, ask whether a single situation could satisfy all of them, because a list that cannot hold together gives no trustworthy conclusions.

  1. Can you write down one example, a number, a set of values or a scenario, that meets every condition?

    If yes, the conditions are consistent, and that one example proves it. If you cannot find one, do not conclude anything yet; combine the conditions to see whether they force a clash.

  2. Do two conditions, combined, force something impossible such as 0=1, or x>5 together with x<3?

    If yes, the set is inconsistent and has no solution. That single clash, a statement and its opposite, is a contradiction; pointing to one settles the whole set.

  3. Does each condition look harmless alone but fail in combination with the others?

    That is how inconsistency usually hides: x+y=4, x−y=2 and x=5 each look fine, but the first two force x=3. Check the conditions together, never one at a time.

  4. Is the question whether a conclusion follows from the conditions, rather than whether they can all hold?

    If yes, that is validity of an argument, a separate matter: 'all cats fly; Tom is a cat; so Tom flies' is valid though a premise is false. Consistency asks only whether the starting statements can coexist.

Consistency (Meta) compared with Completeness, Contradiction, and Validity (of an argument)

All four rows judge statements as a group, which is why they get mixed up. Ask what is being judged: whether they can all be true together (consistency), whether they prove every truth (completeness), one specific clash (contradiction), or whether a conclusion follows from them (validity).

Consistency (Meta)

Meaning
Use this when you must check that a set of statements or rules can all be true together with no contradiction.
Key test
Can every statement in this set be true at the same time without forcing a contradiction?
Formula
A set of statements {P1,P2,…,Pn} is consistent ⇔ P1∧P2∧⋯∧Pn≠⊥
Example
Are these consistent: x>5, x<10, and x=12?

Completeness

Meaning
Asks whether every truth is provable, not whether contradictions are absent.
Key test
Use when checking provability of all truths, not freedom from clashes.
Formula
T⊢φ or T⊢¬φ
Example
Can the axioms decide every statement?

Contradiction

Meaning
A single clash (P∧¬P); consistency is the system-wide absence of any such clash.
Key test
Use when pointing to one specific impossible pair.
Formula
P∧¬P
Example
'x>0 and x<0'

Validity (of an argument)

Meaning
Whether a conclusion follows from premises, regardless of contradiction among them.
Key test
Use when judging an inference, not the coexistence of statements.
Example
Premises entail the conclusion

Formula & Notation

A set of statements {P1,P2,…,Pn} is consistent ⇔ P1∧P2∧⋯∧Pn⊬⊥ (equivalently, some assignment or model makes every Pi true)
A theory T is consistent iff T⊬⊥; equivalently, ∃ a model M such that M⊨T (satisfiability)

How to read it: ⊥ denotes a contradiction (falsum); a system is consistent if it does not entail ⊥

Worked Examples

Example 1 — Check a constraint set

Easy

Are these consistent: x>5, x<10, and x=12?
Show the steps and the answer
  1. Combine the first two conditions: x>5 and x<10 allow exactly the numbers with 5<x<10.

    These two are consistent with each other, since x=7 satisfies both.

  2. Bring in the third condition: x=12 fixes x completely, so 12 is the only candidate.

    An equation of the form x= number leaves no other values to try.

  3. Test the candidate: 12 is not less than 10, so it breaks x<10.

    No single x makes all three statements true, so the set is inconsistent.

  4. Locate the clash: x<10 and x=12 already contradict each other, and x>5 is not involved.

    Naming the clashing pair shows what to fix; changing x<10 to x<15 would make the set consistent.

Answer: Inconsistent

Takeaway: A set is inconsistent when no single value satisfies every statement at once. Find the smallest group that clashes, here x<10 with x=12.

Example 2 — Completeness, not consistency

Standard

Someone says a system is fine because it 'can prove every true statement.' Is that the same as consistency?
Show the steps and the answer
  1. Name the property claimed: every true statement is provable. That is completeness.

    Completeness is about how far the proofs reach, not about clashes among them.

  2. Recall what consistency asks: that the system never proves both a statement and its negation.

    That is a separate question about whether a contradiction can be derived.

  3. Picture a system that proves everything, including both 1=2 and 1≠2.

    It proves every true statement, so it meets the claim, yet it is inconsistent and useless, so proving every truth cannot certify that a system is trustworthy.

  4. Note the other direction: a system can be consistent and still unable to prove some truths, as Gödel showed for arithmetic.

    The two properties come apart in both directions, so each has to be checked on its own.

Answer: That describes completeness, not consistency

Takeaway: 'Proves every true statement' describes completeness. Consistency is the separate guarantee that no contradiction can be proved.

Example 3 — Find the mistake: one point for all three

Application

Can these all hold at once: x+y=10, x−y=2, 2x+y=15? Dev writes: "Yes. (5,5) satisfies the first and third equations, and (3,1) satisfies the second, so the set is consistent." Find the mistake and correct it.
Show the steps and the answer
  1. State what consistency needs: one pair (x,y) that satisfies all three equations together.

    Dev used two different points, which only shows that each equation can be satisfied on its own.

  2. Solve the first two together: adding them gives 2x=12, so x=6 and y=4.

    These two equations alone already pin down a single point.

  3. Test that point in the third equation: 2(6)+4=16≠15.

    The only point satisfying the first two misses the third, so no point satisfies all three.

  4. Confirm with Dev's points: (5,5) gives 5−5=0≠2, and (3,1) gives 3+1=4≠10.

    Each of his points fails at least one equation, as it must.

Answer: The set is inconsistent: x+y=10 and x−y=2 force (6,4), and 2(6)+4=16≠15.

Takeaway: Consistency needs one example satisfying every statement at the same time. Statements that are each fine alone can still clash as a set.

Where You'll See It

  • Building a school timetable

    Timetabling software treats each rule, such as 'Ms Lee teaches 9A on Mondays', 'Ms Lee has Monday mornings free' and '9A has maths only on Monday mornings', as a statement and searches for one timetable meeting all of them. If none exists, it reports which rules clash so that a person can relax one.

  • A misprinted sudoku

    A published sudoku's givens must be consistent: at least one completed grid has to satisfy them. A misprinted clue, such as a second 7 in the same row, makes the puzzle inconsistent, and no amount of clever solving can finish it.

  • Clashing clauses in a lease

    A lease that says 'rent is due on the 1st' in one clause and 'rent is due on the 5th' in another cannot be obeyed as written; a court would have to decide which clause wins. Lawyers proofread contracts for exactly these clashes before anyone signs.

Common Mistakes

  1. The slip: Confusing consistency with completeness

    Instead: consistency forbids contradictions; completeness requires every truth be provable.

  2. The slip: Ignoring a hidden contradiction because each rule looks fine alone

    Instead: check the rules together, not one by one.

  3. The slip: Trusting conclusions from an inconsistent set

    Instead: from a contradiction every statement is derivable, so the system is meaningless.


Mini Practice

Try these on your own. Tap Reveal when you want to check.

  1. Are the statements x+y=10 and x+y=12 consistent?

    Hint: Could the same pair of numbers make both true?

  2. Are these consistent: 2x+y=7, x−y=2 and x+y=5?

    Hint: Solve the first two together, then test the third.

  3. Three friends sit in a row of 3 seats. Rules: Ana is left of Ben, Ben is left of Cal, and Cal is left of Ana. Can all three rules hold at once?

    Hint: Follow the first two rules. Where does that put Ana compared with Cal?

  4. Find the value of k that makes x+2y=4 and 3x+6y=k consistent.

    Hint: Compare the left side of the second equation with 3 times the first.

  5. A board game's rule book never contradicts itself, but it says nothing about what happens when 2 pieces land on the same square. Is that a problem of consistency or completeness?

    Hint: Is there a contradiction, or a question the rules cannot settle?

  6. Ming checks x>3, x<8 and x>9 one at a time, finds each has solutions, and says the set is consistent. Correct her.

    Hint: Test the statements together, not one at a time.

Want the full set?

50 practice questions for this concept — free to try, every one with a complete worked solution showing the why, not just the answer.

Frequently Asked Questions

Why does a single contradiction let you prove anything?

Suppose you have both PP and not PP, and you want to prove any claim QQ, even 'the moon is made of cheese'. From PP you may conclude 'PP or QQ', since that needs only one part to be true. But not PP rules out the first part, so QQ must hold. This argument, the principle of explosion, works for every QQ, which is why an inconsistent system is useless rather than slightly wrong.

How do mathematicians know their axioms are consistent?

Usually by building a model, an example in which every axiom is true. Non-Euclidean geometry was accepted as consistent once mathematicians built models of it inside ordinary Euclidean geometry, so any contradiction in the new geometry would also be one in the old. For arithmetic, Gödel showed that a consistent system of that strength cannot prove its own consistency, so some trust always rests outside the system.

Can a set of statements be consistent but false?

Yes. 'Every swan is black' and 'I own a swan' can both be true together, so the pair is consistent, even though the first is false in our world, where white swans exist. Consistency rules out only internal clashes. A suspect whose story is consistent has not shown the story is true, only that it does not contradict itself; it may still clash with outside evidence.

What does consistency look like in a Sudoku?

The given digits plus the rules form a list of conditions. A badly made puzzle can be inconsistent: two givens may force the same digit twice into one row several steps later, even though no rule is broken at the start. Good puzzles are also designed to have exactly one solution, a stronger demand than consistency, which needs only at least one.

Learning Path

← Before

Logical Statement
Consistency (Meta)

You are here

Next →

Contradiction
You need Logical Statement first: sentences that are either true or false and can be joined with 'and'. Consistency adds the question of whether a whole set of statements can be true together, settled by one example or by a derived clash. Next, Contradiction studies that clash itself and turns it into a proof method: assume the opposite of a claim and show the resulting set is inconsistent.

See Also