I Am What You Read Think for yourself Explore Feed

Test the evidence

Validity Turns a Good Argument Into More Than a Neat Form

Formal logic shows what follows from premises; argumentation asks whether those premises have earned their place in a dispute. The two meet in rigor and part at the world.

One system

formal logic

The other

argumentation

Formal validity and dialectical burden of proof touch where an inference's shape can be assessed apart from, but never finally instead of, the support for its premises.

Reasoning needs both a form that preserves commitment and a practice that makes commitments answerable.

Formal logic arrives with a severe little promise. Grant the premises, and the conclusion will behave.

Argumentation arrives afterward, carrying the premises by the collar. Where did these come from? Who said they were granted? Why is this conclusion in the room at all?

The difference is not a quarrel over whether rigor matters. It is a disagreement about where rigor finishes its shift.

Frege’s Begriffsschrift is a slim apparatus with a title long enough to require its own satchel.

It gave modern logic quantifiers over variables, built from negation, the conditional, and universal quantification. Aristotle’s syllogisms had been doing respectable service for two thousand years, and they could not express relations or nested quantifiers.

Frege gave thought a new set of plumbing.

Russell and Whitehead then tried to derive pure mathematics from logical primitives across the three volumes of Principia Mathematica.

The famous proof that one plus one equals two does not complete until the second volume. The result is occasionally useful. The patience required to obtain it is a separate metaphysical question.

This machinery is built for one clean question. Does the conclusion follow?

Set down two premises. All mammals are warm-blooded. Whales are mammals.

Now set down the conclusion: whales are warm-blooded.

The conclusion follows before either premise has been checked against a whale, a mammal, or a thermometer.

Form has preserved the commitment.

That is validity. No case can make the premises true and the conclusion false.

An ordinary sound argument needs more: valid form and true premises. Neither requirement sends a field researcher to find out whether whales are warm-blooded. The symbols have no field boots.

The available tests are wonderfully strict about their jurisdiction.

A truth table enumerates every assignment of truth values, doubling its rows with each new variable. It catches a counterexample with the impersonal satisfaction of a customs officer.

But it cannot display the inner structure of all or some. A three-circle Venn diagram handles categorical syllogisms. Relations, time, and multi-place predicates walk straight through the wall.

Natural deduction is the larger apparatus.

With introduction and elimination rules, assumptions, and their discharge, it constructs a licensed route from premise to conclusion. A proof has the homely decency of showing its work.

So the temptation is to let the derivation settle everything.

Put an argument into symbols, find a route through, and call the whole business sound. The newspaper columnist has become a theorem, and the premises have received their little formal hats.

It does not work.

Formalization decides what follows from a representation. It does not settle whether the representation captured an ordinary sentence, whether an omitted premise deserves admission, or whether the admitted premises have earned belief.

There may be a uniquely correct formalization for every important ordinary-language argument. That is speculation, not a fact any derivation has established.

Real arguments rarely present themselves as numbered premises wearing name tags.

Therefore, thus, so, and it follows that often announce a conclusion. Because, since, and given that often introduce support.

More often there is an enthymeme. Socrates is human, so Socrates is mortal, with “all humans are mortal” left downstairs holding the coats.

Standard form brings the premise upstairs, numbers the claims, and marks the conclusion last.

Then charity becomes necessary, which is awkward for anyone who had hoped logic would eliminate manners.

The principle of charity asks for the strongest defensible reconstruction the words permit, not the easiest object to destroy.

Dennett’s discipline asks an interpreter to state the position clearly, name agreements, say what has been learned, and only then criticize.

Past that point, charity becomes invention. A better argument, perhaps, but not the one anybody made.

The premise check is where the world returns with paperwork.

One standard asks whether premises are acceptable, relevant, and jointly sufficient. A date, a measurement, or a causal claim cannot be made true by a correctly placed arrow.

Logical entailment says what follows if the premises hold. Empirical confirmation asks whether they hold. Causal inference asks still another question: whether the alleged relation is doing the causing, or merely standing nearby looking correlated.

The burden of proof supplies the social geometry.

The burden lies with the one who asserts, not the one who denies.

But a courtroom’s presumption of innocence, a literature’s null hypothesis, and an everyday preference for the mundane are conventions of different rooms. They are not theorems from a common ceiling.

When a dispute becomes only a fight about who must establish what, argumentation theory calls it burden tennis. Nobody has won. The ball has simply stopped meaning anything.

Toulmin’s model makes the missing furniture visible: claim, grounds, warrant, backing, qualifier, rebuttal.

It is made for the arguments that dominate ordinary life, whose warrants are usually unspoken and whose exceptions turn up late, carrying receipts.

Formal logic can assess a stated deductive skeleton exactly. Argumentation asks whether the skeleton belongs to the creature under discussion, and whether it can stand.

The formal story is not therefore a toy.

Gödel proved first-order completeness before he was twenty-five. In a fixed first-order system, semantic entailment and derivability coincide. If a formula is valid, some finite proof exists.

The guarantee is extraordinary. It has nothing to say about whether a journalist’s evidence was responsibly gathered.

It also does not say that logic is a vending machine for answers.

Church and Turing showed independently that no algorithm always decides arbitrary first-order validity.

A proof search can eventually find a proof for a valid formula. For an invalid one it may keep searching into the heat death of the departmental server.

Completeness and decidability are not synonyms, however much their names appear to have conspired over lunch.

No psychological finding is doing the central work here.

There is no experiment whose replication rate decides whether a conclusion is entailed, and no p-value that converts a causal hypothesis into a premise.

The distinction is conceptual. A valid inference can carry a false empirical claim with flawless discipline. An empirical finding can be well supported without becoming deductively entailed by its background.

What the two disciplines share is not that informal argumentation is logic with feelings, or that symbols have finally disciplined conversation.

It is that both insist commitments must travel without changing their passports.

Formal logic asks whether the route preserves them. Argumentation asks whether the traveler was entitled to board.

One guards the shape of the step. The other makes the ground answer for it.

The tempting reading, refused

Formalization makes an argument automatically sound.

A valid pattern carries false premises with perfect obedience.

What you can take forward

  1. Validity asks whether a deductive conclusion follows from its premises, while soundness in ordinary argument requires both validity and true premises.
  2. Truth tables decide propositional validity by exhaustively checking 2^n truth-value assignments, but cannot represent quantified claims' internal structure.
  3. Natural deduction derives a conclusion through licensed inference rules and reaches first-order arguments that truth tables and three-circle Venn diagrams cannot represent.
  4. Argument reconstruction identifies premises, conclusion, and any unstated enthymematic premise before evaluation.
  5. RSA evaluates premises for acceptability, relevance, and joint sufficiency rather than treating valid form as evidence that premises are true.
  6. The principle of charity reconstructs the strongest defensible reading consistent with what an arguer said, without inventing a different argument.
  7. Burden of proof falls on the party departing from a contextually established presumption, and failure to meet it does not prove the negation.
  8. First-order logic is complete but undecidable: a proof search eventually finds a proof of a valid formula, while it need not certify invalidity.

Go deeper

What makes an argument valid?
A deductive argument is valid when no interpretation makes all of its premises true and its conclusion false. Validity concerns the argument's structure, not the actual truth of its premises. If the premises are granted, the conclusion is forced; if a premise is false, validity still describes the relation correctly and does not repair the premise.
Is a valid argument automatically sound?
No. In ordinary argument evaluation, a sound argument is valid and has true premises. A valid pattern can carry false premises to a false conclusion without any structural error. Logic also uses soundness in a separate proof-theoretic sense: a sound proof system derives only formulas semantically entailed by its premises. That property does not establish a particular premise as true of the world.
How does someone find the conclusion in a messy argument?
The conclusion is the claim an argument tries to establish, while premises are the claims offered in support. Words such as therefore, thus, so, and it follows that often introduce a conclusion; because, since, and given that often introduce a premise. When no indicator appears, the relevant test asks which sentence the rest of the passage is trying to make acceptable.
What is an enthymeme?
An enthymeme is an argument with an unstated premise treated as obvious by its arguer. The statement that Socrates is human and therefore mortal leaves out the premise that all humans are mortal. Reconstruction puts the missing premise into standard form, with numbered premises and the conclusion marked last, so that the actual inferential structure can be tested.
What does a truth table actually test?
A truth table tests propositional validity by listing every possible truth-value assignment and looking for a row where all premises are true but the conclusion is false. With n distinct propositional variables, it has 2^n rows; three variables require eight rows and five require thirty-two. It is decisive for propositional logic but does not capture the internal structure of quantified claims.
Why are Venn diagrams not enough for every syllogism?
A three-circle Venn diagram decisively tests categorical syllogisms by shading regions ruled out by the premises and checking whether the conclusion is forced. It handles arguments about class membership, such as all A being B. It cannot represent comparative, temporal, or multi-place relations, so it does not extend to the broader first-order arguments formal logic can express.
What does natural deduction add beyond a truth table?
Natural deduction constructs a derivation of a conclusion from premises through fixed inference rules, including modus ponens, conjunction introduction, and universal instantiation. It handles quantified and relational first-order arguments that truth tables and Venn diagrams cannot represent. Unlike a truth table for propositional logic, however, no general finite search procedure is guaranteed to find a first-order proof when one is not readily available.
Why does putting an argument into symbols not prove its premises?
Symbolization can make an argument's deductive shape explicit and establish what follows if its premises are granted. It does not determine whether a historical claim, scientific finding, legal fact, or other premise is true. Formal proof normally stipulates premises as given; argument evaluation must separately check whether they are acceptable to the relevant audience and supported by the world.
What are the RSA criteria for an argument?
RSA asks whether an argument's premises are acceptable, relevant, and jointly sufficient. Acceptability concerns truth or other justification; relevance concerns whether a premise bears on the conclusion; sufficiency concerns whether the premises together provide enough support. The criteria keep premise evaluation separate from validity, because a formally valid argument can still rest on unsupported material.
What does the principle of charity require?
The principle of charity requires an interpreter to reconstruct an ambiguous argument in the strongest defensible form consistent with what its author actually said. Daniel Dennett's discipline is to restate the position clearly, state points of agreement, identify what has been learned from it, and then criticize it. Charity does not license inventing a different, more defensible argument.
Who has the burden of proof in an argument?
The burden of proof normally falls on the party asserting a claim against an established presumption: onus probandi incumbit ei qui dicit, non ei qui negat. The baseline depends on context. A courtroom presumes innocence, scientific work commonly begins with a null hypothesis, and everyday discussion usually favors the more mundane explanation. Logic alone does not fix that allocation.
Does failing to prove a claim prove that it is false?
No. Failure to meet a burden of proof means that the claim has not earned acceptance under the relevant standard; it does not establish its negation. Treating an unproven claim as false is an argument from ignorance. A dispute that turns entirely into arguments about who must supply evidence is often called burden tennis, and it leaves the original issue unresolved.
How can first-order logic be complete and undecidable at once?
Completeness means that every first-order formula semantically entailed by premises has a formal proof. Gödel proved this result in 1929 and published it in 1930; Henkin supplied a widely used simplified proof in 1949. Undecidability means no algorithm always halts with the correct answer on validity. Church and Turing independently proved that limitation in 1936.