Read
Build the mental model
Move through the guided explanation first so the central distinction and purpose are clear before you evaluate your own work.
Propositional Logic
Capstone: Symbolizing, Proving, and Refuting Propositional Arguments
An integrative lesson that asks students to run the full propositional cycle on mixed arguments: symbolize from English, classify validity, either prove the argument or build a truth-assignment counterexample, and explain the result in plain language.
Read the explanation sections first, then use the activities to test whether you can apply the idea under pressure.
Start Here
What this lesson is helping you do
An integrative lesson that asks students to run the full propositional cycle on mixed arguments: symbolize from English, classify validity, either prove the argument or build a truth-assignment counterexample, and explain the result in plain language. The practice in this lesson depends on understanding Validity and applying tools such as Respect the Main Connective and Assign Sentence Letters Consistently correctly.
How to approach it
Read the explanation sections first, then use the activities to test whether you can apply the idea under pressure.
What the practice is building
You will put the explanation to work through guided problem solving and quiz activities, so the goal is not just to recognize the idea but to use it under your own control.
What success should let you do
Complete the full evaluation cycle for at least 3 integrative cases, producing translation, validity classification, proof or counterexample, and plain-English explanation for each.
Reading Path
Move through the lesson in this order
The page is designed to teach before it tests. Use this sequence to keep the reading, examples, and practice in the right relationship.
Study
Watch the move in context
Use the worked example to see how the reasoning behaves when someone else performs it carefully.
Do
Practice with a standard
Only then move into the activities, using the pause-and-check prompts as a final checkpoint before you submit.
Guided Explanation
Read this before you try the activity
These sections give the learner a usable mental model first, so the practice feels like application rather than guesswork.
Framing
Running the unit pipeline end-to-end
Earlier lessons drilled each propositional move in isolation: identify atomic claims, assign sentence letters, track the main connective, and check validity by truth tables or short proofs. The capstone asks you to run the whole pipeline on a single argument without being told which move to apply.
Real arguments do not arrive pre-labeled. You have to decide whether to translate, prove, or refute, and in what order. The purpose of this capstone is to train the handoffs between those stages so that you can carry out the full evaluation fluently.
What to look for
- Translate before you judge.
- Judge validity before you search for a proof.
- Switch to refutation when a proof attempt stalls for structural reasons.
Propositional evaluation is a pipeline; the capstone trains the handoffs between its stages.
Strategy
Choose the move that matches the case
Use a fixed pattern: translate into symbolic form, look at the shape of the argument, and ask whether it matches a known valid pattern. If it does, construct the proof. If it does not, look for a row of truth values that makes every premise true and the conclusion false. That row is your counterexample.
The hardest skill is knowing when to switch. If you have spent a while looking for a proof with no structural progress, stop and try to refute. Many invalid arguments feel convincing until you force yourself to search for a counterexample.
What to look for
- Translate, then classify, then attempt proof or refutation.
- Switch to counterexample search when a proof stalls.
- Close with a one-paragraph plain-English explanation.
A fixed pipeline keeps you from confusing a stuck proof attempt with a hard proof.
Error patterns
How integration failures actually look
The most common failure is translating grammar instead of logical form, which produces a symbolic argument that is not faithful to the English one and makes every subsequent move unreliable. Always read your symbolic version back into English to check.
The second most common failure is giving up on refutation because the conclusion feels true. Truth-functional validity has nothing to do with whether the conclusion is actually true; a counterexample can exist even when the conclusion is a familiar or agreeable statement.
What to look for
- Do not translate grammar; translate logical form.
- Do not abandon refutation because the conclusion feels true.
- Do not skip reading the symbolic version back into English.
Integration failures cluster around faithless translations and abandoned refutation attempts.
Before practice
What this lesson is testing
The cases below each require translation, validity judgment, and either proof or refutation. Some of the arguments are valid; some are not. Part of the exercise is deciding which.
Treat the capstone as practice for encountering arguments in the wild. The point is not to be fast. The point is to run the pipeline cleanly and to change strategies when a move stalls.
What to look for
- Produce all four outputs for every case.
- Change strategies when a proof attempt stalls structurally.
- Treat the explanation as the final output, not an afterthought.
The capstone measures how cleanly you run the full pipeline when no step has been prescribed.
Core Ideas
The main concepts to keep in view
Use these as anchors while you read the example and draft your response. If the concepts blur together, the practice usually blurs too.
Validity
The property of an argument whose conclusion cannot be false while all its premises are true.
Why it matters: Validity is the central standard of deductive evaluation, and in propositional logic it can be mechanically tested.
Reference
Open these only when you need the extra structure
How the lesson is meant to unfold
Review
This step supports the lesson by moving from explanation toward application.
Guided Synthesis
This step supports the lesson by moving from explanation toward application.
Independent Synthesis
This step supports the lesson by moving from explanation toward application.
Reflection
This step supports the lesson by moving from explanation toward application.
Mastery Check
The final target tells you what successful understanding should enable you to do.
Reasoning tools and formal patterns
Rules and standards
These are the criteria the unit uses to judge whether your reasoning is actually sound.
Respect the Main Connective
A symbolization is acceptable only if the main connective of the symbolic form matches the main connective of the natural-language statement.
Common failures
- A conditional is symbolized as a conjunction because the student saw two claims joined.
- A negation is applied to one conjunct when the whole conjunction was intended to be negated.
- A biconditional is read as a one-directional conditional.
Assign Sentence Letters Consistently
Use the same sentence letter for every occurrence of the same atomic claim, and use different letters for distinct claims.
Common failures
- The same claim is given two different letters in the same argument.
- Two different claims are given the same letter because they share a topic.
- A negated and an unnegated version of the same claim are assigned different letters.
Truth-Functional Validity Standard
A propositional argument is valid if and only if there is no truth-value assignment on which the premises are all true and the conclusion is false.
Common failures
- The student treats one favorable row as proof of validity.
- The student reads off the truth of the conclusion without checking whether the premises are all true in that row.
- The student mistakes invalidity for falsehood or vice versa.
Modus Ponens
From 'P → Q' and 'P', one may derive 'Q'.
Common failures
- The student affirms the consequent by deriving 'P' from 'P → Q' and 'Q'.
- The student derives 'Q' from 'Q → P' and 'P' after confusing the direction of the conditional.
Modus Tollens
From 'P → Q' and '¬Q', one may derive '¬P'.
Common failures
- The student denies the antecedent by deriving '¬Q' from 'P → Q' and '¬P'.
- The student ignores the conditional's direction when the negation is placed on the consequent.
Disjunctive Syllogism
From 'P ∨ Q' and '¬P', one may derive 'Q'; similarly from 'P ∨ Q' and '¬Q', one may derive 'P'.
Common failures
- The student derives the negated disjunct instead of the remaining disjunct.
- The student assumes an exclusive disjunction and draws an unlicensed inference about the second disjunct.
Patterns
Use these when you need to turn a messy passage into a cleaner logical structure before evaluating it.
Argument Symbolization Schema
Input form
natural_language_argument
Output form
propositional_argument_form
Steps
- Identify the distinct atomic claims used in the argument.
- Assign a sentence letter to each distinct atomic claim and record the key.
- For each premise and the conclusion, find the main connective.
- Symbolize each statement using the assigned letters and the main connective.
- Verify that the final symbolization preserves both scope and inferential role.
Watch for
- Using one sentence letter for two different claims that merely share a topic.
- Failing to identify the main connective and symbolizing from the wrong structural layer.
- Applying negation to the wrong part of a compound statement.
Truth-Table Validity Test
Input form
propositional_argument_form
Output form
validity_judgment
Steps
- List the atomic letters used in the premises and conclusion.
- Enumerate every truth-value assignment to those letters (2^n rows).
- Compute the truth value of each premise and the conclusion in every row.
- Find any row in which all premises are true and the conclusion is false.
- Classify the argument as valid if no such row exists and invalid otherwise.
Watch for
- Omitting rows and failing to cover all assignments.
- Mislabeling a row as a counterexample without checking that every premise is true in it.
- Confusing the shape of the truth table with the shape of the argument.
Worked Through
Examples that model the standard before you try it
Do not skim these. A worked example earns its place when you can point to the exact move it is modeling and the mistake it is trying to prevent.
Worked Example
Full-Cycle Walkthrough
A full-cycle answer includes every stage, not just the proof. The explanation in plain English is what makes the result usable.
Argument
- If the CI pipeline passes, the release is promoted.
- If the release is promoted, the changelog is published.
- The CI pipeline passed.
- Therefore the changelog is published.
Proof Sketch
- 1. C -> R (premise)
- 2. R -> L (premise)
- 3. C (premise)
- 4. R (modus ponens, 1 and 3)
- 5. L (modus ponens, 2 and 4)
Symbolic Form
- C -> R
- R -> L
- C
- therefore L
Classification
Valid.
Sentence Letter Key
C
The CI pipeline passes.
L
The changelog is published.
R
The release is promoted.
Plain English Explanation
The argument chains two conditionals with the first antecedent asserted. Once C holds, the first conditional gives us R, and the second gives us L. The conclusion follows necessarily.
Pause and Check
Questions to use before you move into practice
Self-check questions
- Did I produce all four outputs for each case?
- Did I decide whether to prove or refute before I started writing the proof?
- Does my plain-English explanation make sense to someone who does not know the notation?
Practice
Now apply the idea yourself
Move into practice only after you can name the standard you are using and the structure you are trying to preserve or evaluate.
Guided Problem Solving
DeductiveFull-Cycle Propositional Evaluation
For each argument, produce: (1) a sentence-letter key and symbolic form, (2) a validity classification, (3) either a short proof or a truth-assignment counterexample, and (4) a one-paragraph plain-English explanation.
Integrative cases
Work one case at a time. These cases are deliberately mixed; part of the exercise is deciding which moves from the unit each case requires.
Case A
If the backup runs, the archive is current. The backup ran. Therefore the archive is current.
A single-step modus ponens. Verify with both a proof and a check that no counterexample exists.
Case B
If a site passes security review, it is deployed. The site was deployed. So the site passed security review.
Watch the direction of the conditional. Is there a row of truth values that makes both premises true and the conclusion false?
Case C
Either the sensor misfired or the pump failed. The sensor did not misfire. If the pump failed, maintenance must be paged. Therefore maintenance must be paged.
Combine disjunctive syllogism with a second conditional step.
Case D
The alarm fires only if the motion sensor triggers. The alarm did not fire. Therefore the motion sensor did not trigger.
'Only if' sets the direction of the conditional. Then apply modus tollens.
Case E
If the experiment is controlled, the results are reliable. The experiment is not controlled. Therefore the results are not reliable.
A tempting-looking inference. Is there a world where both premises are true and the conclusion is false?
Proof Draft
LineStatementJustificationAction
1
2
3
Quiz
DeductiveCapstone Check Questions
Answer each short check question in one or two sentences. These questions test whether you can articulate the reasoning you just performed in your own words.
Check questions
Answer each question from memory in your own words. No answer should need more than two sentences.
Question 1
Why does translating grammar rather than logical form break the rest of the pipeline?
Every subsequent move depends on faithful translation.
Question 2
When should you stop looking for a proof and switch to building a counterexample?
When the proof attempt is stalled for structural reasons.
Question 3
Why can a counterexample exist even when an argument's conclusion is actually true?
Validity is about every possible truth assignment, not the actual one.
Question 4
What is the final output of the propositional evaluation pipeline and why?
A plain-English explanation that a non-logician could read.
Proof Draft
LineStatementJustificationAction
1
2
3
Truth-Table Builder
Enter a propositional formula using variables (P, Q, R...) and connectives. Separate multiple formulas with commas to compare them.
~ or ¬& or ∧| or ∨-> or →<-> or ↔
| P | Q | P → Q |
|---|---|---|
| F | F | T |
| F | T | T |
| T | F | F |
| T | T | T |
Contingent2 variables · 4 rows · 3 true
Proof Constructor
Build a formal proof step by step. Add premises, apply inference rules, cite earlier lines, and derive your conclusion.
Add premises and derived steps above, or load a template to get started.
\u2588 Premise\u2588 Derived step
Symbols:\u00AC not\u2227 and\u2228 or\u2192 if-then\u2194 iff\u2234 therefore
Animated Explainers
Step-by-step visual walkthroughs of key concepts. Click to start.
Read the explanation carefully before jumping to activities!
Further Support
Open these only if you need extra help or context
Mistakes to avoid before submitting
- Burning time on a proof attempt for an invalid argument.
- Forgetting that the output of propositional evaluation is a communicable result, not just a proof.
Where students usually go wrong
Translating grammar instead of logical form.
Searching for a proof on an invalid argument and never switching to refutation.
Producing a correct proof but no plain-English explanation.
Writing an explanation that is just the symbolic proof translated word-for-word.
Historical context for this way of reasoning
Gottlob Frege
Frege insisted that logic was valuable precisely because it let you separate the form of an argument from its subject matter and then communicate the result back into ordinary language. The capstone is a small-scale rehearsal of that project.