1. Read the model first
Each lesson opens with a guided explanation so the learner sees what the core move is before any saved response is required.
Predicate Logic
How internal sentence structure changes formal reasoning
Students move beyond sentence-level structure to analyze internal form with predicates, variables, and quantifiers. They learn to translate quantified claims, manage quantifier scope and variable binding, and construct short proofs using universal and existential instantiation and generalization.
Study Flow
1. Read the model first
Each lesson opens with a guided explanation so the learner sees what the core move is before any saved response is required.
2. Study an example on purpose
The examples are there to show what strong reasoning looks like and where the structure becomes clearer than ordinary language.
3. Practice with a target in mind
Activities work best when the learner already knows what the answer needs to show, what rule applies, and what mistake would make the response weak.
Lesson Sequence
Motivates the move from propositional to predicate logic by showing arguments that propositional logic cannot capture and introduces the basic vocabulary of predicates, constants, and variables.
Start with a short reading sequence, study 2 worked examples, then use 15 practice activitys to test whether the distinction is actually clear.
Introduces the universal and existential quantifiers, teaches students to translate simple quantified English claims into first-order form, and establishes the relationship between quantifiers and the connectives that typically accompany them.
Start with a short reading sequence, study 2 worked examples, then use 15 practice activitys to test whether the distinction is actually clear.
Tackles the hardest translation challenges in predicate logic: multiple quantifiers, nested scope, mixed universal and existential claims, and the subtleties of relational predicates.
Read for structure first, inspect how the example turns ordinary language into cleaner form, then complete 15 formalization exercises yourself.
Introduces the four quantifier inference rules (universal instantiation, existential instantiation, universal generalization, existential generalization) and explains the restrictions that each rule imposes.
Use the reading and examples to learn what the standards demand, then practice applying those standards explicitly in 15 activitys.
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.
Each lesson now opens with guided reading, then moves through examples and 2 practice activitys so you are not dropped into the task cold.
Rules And Standards
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
Formalization Patterns
Input form
natural_language_claim
Output form
first_order_formula
Steps
Common errors
Input form
first_order_argument
Output form
quantifier_sensitive_derivation
Steps
Common errors
Concept Map
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.
A symbol that names a specific object in the domain of discourse, typically written with lowercase letters like a, b, c.
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.
The set of objects that the variables of a predicate-logic formula are taken to range over in a given interpretation.
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.'
The scope of a quantifier is the portion of a formula it governs; a variable occurrence is bound if it falls within the scope of a quantifier using the same variable, and free otherwise.
The quantifier ∀x, read 'for all x,' which claims that the formula it binds holds for every object in the domain.
The quantifier ∃x, read 'there exists x such that,' which claims that the formula it binds holds for at least one object in the domain.
A proof move that goes from a quantified claim to a claim about a specific individual; universal instantiation picks any individual, while existential instantiation introduces a fresh name for a witness.
A proof move that goes from a claim about an individual to a quantified claim; universal generalization is allowed only when the individual was arbitrary, and existential generalization is always allowed when a specific instance has been found.
Assessment
Assessment advice
Mastery requirements
History Links
Introduced the first formal system of quantified logic in his Begriffsschrift, making generality and existence expressible with explicit variable binding.
Systematized quantified logic in Principia Mathematica and used it to formalize large portions of mathematics.
Gave the first rigorous model-theoretic semantics for quantified logic, defining truth in a model in terms of variable assignments.