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.
Predicate Logic
An integrative lesson that asks students to translate ordinary-language arguments involving quantifiers and predicates, construct short proofs using quantifier rules, and diagnose scope errors.
Read the explanation sections first, then use the activities to test whether you can apply the idea under pressure.
Start Here
An integrative lesson that asks students to translate ordinary-language arguments involving quantifiers and predicates, construct short proofs using quantifier rules, and diagnose scope errors. The practice in this lesson depends on understanding Predicate, Variable, and Quantifier and applying tools such as Universal Instantiation and Existential Instantiation 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
Run the full predicate pipeline on at least 3 mixed quantified arguments, producing translation, proof or scope diagnosis, and plain-English explanation.
Reading Path
The page is designed to teach before it tests. Use this sequence to keep the reading, examples, and practice in the right relationship.
Read
Move through the guided explanation first so the central distinction and purpose are clear before you evaluate your own work.
Study
Use the worked example to see how the reasoning behaves when someone else performs it carefully.
Do
Only then move into the activities, using the pause-and-check prompts as a final checkpoint before you submit.
Guided Explanation
These sections give the learner a usable mental model first, so the practice feels like application rather than guesswork.
Framing
Earlier lessons taught the parts in isolation: standard translations into predicate logic, the four quantifier rules, and the importance of scope and binding. The capstone asks you to carry out the full cycle on arguments that mix quantifiers and require careful scope tracking.
Predicate reasoning is more error-prone than propositional reasoning because scope matters. A universally quantified claim and an existentially quantified claim that differ only in scope can have very different consequences, and real arguments often rely on that difference.
What to look for
Strategy
Use a fixed pattern: (1) choose a domain and a set of predicates, (2) translate every sentence with explicit quantifier scope, (3) look at the argument pattern and identify which quantifier rules are needed, (4) construct the proof, (5) if a proof fails, check whether the failure is a scope error or a true invalidity.
The hardest move is distinguishing 'all students study' (∀x(Sx → Tx)) from 'everything is a studying student' (∀x(Sx ∧ Tx)). They differ dramatically in what they claim. If your translation confuses these, the rest of your analysis will be unreliable.
What to look for
Error patterns
The most common failure is mistranslating a conditional quantified claim as a conjunction, or vice versa. A careful reading-back step catches this: translate your formal version back into English and ask whether it says the same thing as the original.
The second most common failure is applying universal instantiation or existential generalization without tracking whether the variable is free in the surrounding context. Scope violations look locally correct but produce invalid conclusions.
What to look for
Before practice
The cases below mix universally and existentially quantified claims. Some are valid; some contain scope errors; some are valid but require a non-obvious rule sequence.
A case is only complete when you have produced the translation, the proof or a scope diagnosis, and a plain-English explanation.
What to look for
Core Ideas
Use these as anchors while you read the example and draft your response. If the concepts blur together, the practice usually blurs too.
An expression that attributes a property to an object or a relation among several objects; a one-place predicate applies to a single object, while a relational predicate applies to two or more.
Why it matters: Predicates let logic represent internal sentence structure instead of treating whole statements as unanalyzed propositions.
A symbol like x, y, or z that does not name a specific individual but can range over the domain when bound by a quantifier.
Why it matters: Variables are the placeholders that make generality and existence expressible.
An operator that binds a variable and states how much of the domain it ranges over; the universal quantifier ∀ means 'for all,' and the existential quantifier ∃ means 'for some' or 'there exists.'
Why it matters: Quantifiers make generality and existence logically explicit and are the central innovation of predicate logic over categorical and propositional systems.
Reference
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.
Rules and standards
These are the criteria the unit uses to judge whether your reasoning is actually sound.
From ∀x φ(x), infer φ(a) for any individual constant or previously introduced name a.
Common failures
From ∃x φ(x), infer φ(c), where c is a fresh name not appearing earlier in the proof.
Common failures
From φ(a), where a was introduced as an arbitrary individual, infer ∀x φ(x).
Common failures
From φ(a), infer ∃x φ(x) for any individual constant a.
Common failures
No variable occurrence may be treated as bound unless a quantifier with that variable actually governs it, and no free variable may be ignored in semantic evaluation.
Common failures
Patterns
Use these when you need to turn a messy passage into a cleaner logical structure before evaluating it.
Input form
natural_language_claim
Output form
first_order_formula
Steps
Watch for
Input form
first_order_argument
Output form
quantifier_sensitive_derivation
Steps
Watch for
Worked Through
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
When two premises appear to conflict, check whether it is a scope confusion before declaring either premise false.
Passage
Every book in the library has a unique call number. There is a call number used by every book in the library. So every book has the same call number.
Verdict
The argument rests on a scope confusion and is invalid.
Analysis
The first premise gives each book its own call number; the second, if interpreted as ∃y∀x, says there is one call number that every book uses. The two premises are inconsistent; no valid conclusion can follow from both.
Translations
Pause and Check
Self-check questions
Practice
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
DeductiveFor each argument, produce: (1) a predicate translation with explicit domain and quantifier scope, (2) a short proof using quantifier rules, or a scope diagnosis if the argument is invalid, and (3) a plain-English explanation of the result.
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
Every student who submits the assignment on time receives feedback. Maya submitted the assignment on time. Therefore Maya receives feedback.
Universal instantiation followed by modus ponens.
Case B
Some engineers are certified. All certified workers earn a bonus. Therefore some engineers earn a bonus.
Existential instantiation followed by universal instantiation.
Case C
Everyone who reads philosophy is thoughtful. Some thoughtful people are writers. So everyone who reads philosophy is a writer.
Is the intended conclusion consistent with the premises? Consider a scope-respecting counterexample.
Case D
There is a number that every integer is less than or equal to. Therefore every integer is less than or equal to some number.
Watch the quantifier order: ∃y∀x... versus ∀x∃y...
Case E
No senator supports the bill. All senators are politicians. So no politicians support the bill.
Is the term 'politicians' universally covered by 'senators'?
Quiz
DeductiveAnswer 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 quantifier scope matter so much for the correctness of a predicate argument?
Different scopes express different claims.
Question 2
What is the difference between ∀x(Ax → Bx) and ∀x(Ax ∧ Bx)?
One is conditional, the other says everything is A and B.
Question 3
Why does reordering ∃y∀x... to ∀x∃y... change the meaning of a claim?
The witness depends on the bound variable order.
Question 4
What is the first check you perform before applying universal instantiation?
That the variable you introduce is free in the current scope.
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.
Step-by-step visual walkthroughs of key concepts. Click to start.
Read the explanation carefully before jumping to activities!
Further Support
Translating conditional quantified claims as conjunctions or vice versa.
Applying quantifier rules without checking variable scope.
Switching quantifier order between ∀x∃y and ∃y∀x without noticing.
Declaring an argument valid without verifying that every variable in the proof is bound.
Gottlob Frege
Frege's invention of quantifier notation made it possible to express exactly what earlier logicians could only hint at. The capstone is a direct descendant: translate faithfully, track scope, and show that the conclusion does or does not follow.