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
Universal and Existential Quantifiers
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.
Focus on understanding the core distinction first, then use the examples to see how the idea behaves in actual arguments.
Start Here
What this lesson is helping you do
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. The practice in this lesson depends on understanding Quantifier, Scope and Binding, Universal Quantifier, and Existential Quantifier and applying tools such as Universal Instantiation and Existential Instantiation correctly.
How to approach it
Focus on understanding the core distinction first, then use the examples to see how the idea behaves in actual arguments.
What the practice is building
You will put the explanation to work through formalization practice, quiz, proof construction, evaluation practice, analysis practice, rapid identification, and diagnosis practice 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
Correctly translate 10 simple quantified English claims into first-order logic, using the correct pairing of quantifier and connective.
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 examples 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.
Core skill
The universal quantifier and its natural shape
The universal quantifier ∀x, read 'for all x,' asserts that a formula holds for every object in the domain. When we want to say 'all humans are mortal,' we do not write ∀x (Hx ∧ Mx), because that would say 'everything is both a human and mortal' — it would commit us to claiming that every object in the domain is human, which is usually false. Instead, we write ∀x (Hx → Mx), which says 'for every x, if x is a human then x is mortal.' The conditional is doing the restricting work: we are only making a claim about the objects that are humans.
This is the most important translation rule in this unit: universal claims almost always take the form ∀x (restricting-predicate → claim). The restricting predicate on the left picks out the class we are making a claim about, and the conditional ensures that the claim only has to hold for members of that class. Mixing up the conditional and the conjunction is the most common beginner error in universal translation.
What to look for
- Translate 'all S are P' as ∀x (Sx → Px), never as ∀x (Sx ∧ Px).
- Let the conditional restrict the class the universal is making a claim about.
- Reread your formula back into English to confirm the restriction is doing what you intended.
Universal quantifiers pair naturally with conditionals. 'All S are P' is ∀x (Sx → Px), and that pairing is not optional.
Core skill
The existential quantifier and its natural shape
The existential quantifier ∃x, read 'there exists x such that,' asserts that a formula holds for at least one object in the domain. When we want to say 'some cat is black,' we write ∃x (Cx ∧ Bx): there exists an x such that x is a cat and x is black. We do not write ∃x (Cx → Bx), because in classical logic that formula is trivially satisfied by any non-cat: if x is not a cat, Cx is false, so the conditional is true without committing us to anything about black cats.
This is the mirror of the universal rule: existential claims almost always take the form ∃x (restricting-predicate ∧ claim). The conjunction on the inside ensures that the witness we are positing actually belongs to the relevant class and has the relevant property. Mixing up the conjunction with a conditional is the most common beginner error in existential translation.
What to look for
- Translate 'some S is P' as ∃x (Sx ∧ Px), never as ∃x (Sx → Px).
- Let the conjunction ensure the witness actually belongs to the restricting class.
- Reread the formula to confirm you are claiming the existence of an S that is P, not just some object with a vacuously satisfied conditional.
Existential quantifiers pair naturally with conjunctions. 'Some S is P' is ∃x (Sx ∧ Px), and the conjunction is essential.
Deeper understanding
Why the pairings are the way they are
The conditional pairing for universals and the conjunction pairing for existentials are not arbitrary conventions. They follow from how quantifiers interact with truth. If you want to make a claim that restricts its attention to a class and holds for everything in that class, you need an implication: 'anything in the class has this property.' If you want to make a claim that asserts the existence of something in the class with a property, you need a conjunction: 'something is in the class and has this property.' Any other pairing either overshoots (claiming too much) or undershoots (claiming too little).
Students who understand this not just as a rule but as a consequence of the semantics are much less likely to get the pairings wrong. Read the two formulas back into English and confirm: ∀x (Sx → Px) says 'every S is a P'; ∀x (Sx ∧ Px) says 'everything is an S and a P'; ∃x (Sx ∧ Px) says 'some S is a P'; ∃x (Sx → Px) says 'there exists some x that is either not an S or is a P,' which is almost never what you want.
What to look for
- Understand why universals pair with conditionals and existentials with conjunctions.
- Translate both pairings back into English to internalize the semantics.
- Be suspicious of any universal using a top-level conjunction or any existential using a top-level conditional.
The pairings are forced by meaning, not by convention. Understanding them semantically makes the rule feel inevitable.
Critical interaction
Quantifiers and negation
Negation interacts with quantifiers in important ways. The negation of a universal is an existential: ¬∀x Px is equivalent to ∃x ¬Px. In English: 'not everything is P' is 'something is not P.' The negation of an existential is a universal: ¬∃x Px is equivalent to ∀x ¬Px. In English: 'nothing is P' is 'everything is not P.' These equivalences are the predicate-logic analogue of De Morgan's laws, and they are used constantly in translation and proof.
A common confusion is the difference between ¬(∀x Px) and ∀x ¬Px. The first says 'not everything is P' (which leaves room for some P and some not-P). The second says 'nothing is P' (every x has the negated property). These are very different claims, and the difference depends entirely on where the negation falls relative to the quantifier. When in doubt, read the formula aloud and check.
What to look for
- Remember that ¬∀x Px is equivalent to ∃x ¬Px.
- Remember that ¬∃x Px is equivalent to ∀x ¬Px.
- Always check whether a negation is inside or outside a quantifier.
Negation and quantifiers interact via a predicate-logic De Morgan rule. Getting the interaction right is essential for translation accuracy.
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.
Quantifier
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.
Scope and Binding
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.
Why it matters: Most formalization errors in predicate logic come from misjudging quantifier scope or leaving variables unintentionally free.
Universal Quantifier
The quantifier ∀x, read 'for all x,' which claims that the formula it binds holds for every object in the domain.
Why it matters: Universal quantification is how predicate logic expresses claims of the form 'every S is P' without the distribution machinery of categorical logic.
Existential Quantifier
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.
Why it matters: Existential quantification is how predicate logic expresses 'some S is P' and underlies reasoning about witnesses and examples.
Reference
Open these only when you need the extra structure
How the lesson is meant to unfold
Concept Intro
The core idea is defined and separated from nearby confusions.
Rule Or Standard
This step supports the lesson by moving from explanation toward application.
Worked Example
A complete example demonstrates what correct reasoning looks like in context.
Guided Practice
You apply the idea with scaffolding still visible.
Assessment Advice
Use these prompts to judge whether your reasoning meets the standard.
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.
Universal Instantiation
From ∀x φ(x), infer φ(a) for any individual constant or previously introduced name a.
Common failures
- Instantiating to a name that has been reserved for existential reasoning.
- Substituting the same variable for two different bound variables by accident.
Existential Instantiation
From ∃x φ(x), infer φ(c), where c is a fresh name not appearing earlier in the proof.
Common failures
- Reusing an existing name for the witness, which can lead to spurious identifications.
- Treating the witness name as if it had arbitrary properties beyond φ(c).
Universal Generalization
From φ(a), where a was introduced as an arbitrary individual, infer ∀x φ(x).
Common failures
- Generalizing from a name introduced by existential instantiation.
- Generalizing from a name that already has specific properties from earlier premises.
Existential Generalization
From φ(a), infer ∃x φ(x) for any individual constant a.
Common failures
- Generalizing to the wrong variable when φ(a) already contains that variable free.
- Using existential generalization to justify a claim that the original individual was unspecified.
Respect Scope and Binding
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
- Claiming a free variable is bound because another quantifier uses the same letter.
- Misplacing a quantifier so that it binds fewer or more occurrences than intended.
Patterns
Use these when you need to turn a messy passage into a cleaner logical structure before evaluating it.
Quantified Translation Schema
Input form
natural_language_claim
Output form
first_order_formula
Steps
- Identify the domain of discourse.
- Identify the predicates needed and their arities (one-place, two-place, etc.).
- Decide whether each part of the claim is universal, existential, or relational.
- Place quantifiers in the order that the English demands.
- Verify that every variable occurrence is bound and that the scope matches the English meaning.
Watch for
- Swapping the order of nested quantifiers.
- Using a two-place predicate as if it were one-place.
- Letting a variable escape the scope of its quantifier.
Predicate Proof Schema
Input form
first_order_argument
Output form
quantifier_sensitive_derivation
Steps
- Formalize premises and conclusion.
- Instantiate universal premises to names that fit the goal.
- When using an existential premise, introduce a fresh witness name.
- Apply propositional inference rules to the instantiated formulas.
- Generalize only when the name is arbitrary (for universal generalization) or when a specific witness is available (for existential generalization).
Watch for
- Generalizing from a name introduced by existential instantiation.
- Reusing a witness name across different existential claims.
- Skipping the instantiation step and trying to manipulate quantified formulas directly.
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
All Ravens Are Black
The conditional does the restricting work. The formula says nothing about non-ravens; it only makes a commitment about the ones that are ravens.
Content
- Claim: 'All ravens are black.'
- Predicates: R = is a raven, B = is black.
- Formalization: ∀x (Rx → Bx).
- Reading: for every x, if x is a raven then x is black.
Worked Example
No Snake Is Warm-Blooded
Universal and existential formulations of the same claim are often equivalent through the quantifier-negation rule. Either form is acceptable; choose the one that reads more clearly.
Content
- Claim: 'No snake is warm-blooded.'
- Predicates: S = is a snake, W = is warm-blooded.
- Option 1: ¬∃x (Sx ∧ Wx) — 'there is no snake that is warm-blooded.'
- Option 2: ∀x (Sx → ¬Wx) — 'for every x, if x is a snake then x is not warm-blooded.'
- Both formulas are logically equivalent.
Pause and Check
Questions to use before you move into practice
Self-check questions
- Did I use the right pairing (conditional for universal, conjunction for existential)?
- Does the formalization say what the English says when I read it back?
- Is any negation inside or outside the quantifier where I need it to be?
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.
Formalization Practice
DeductiveTranslate the Quantified Claim
Translate each claim into first-order logic. Use the predicate letters provided and pay attention to whether the claim is universal or existential.
Simple quantified claims
For each claim, decide whether the quantifier is universal or existential, then choose the appropriate connective (→ for universals, ∧ for existentials) and symbolize.
Claim A
All ravens are black. (R = is a raven, B = is black)
Universal + conditional.
Claim B
Some mathematician is left-handed. (M = is a mathematician, L = is left-handed)
Existential + conjunction.
Claim C
No snake is warm-blooded. (S = is a snake, W = is warm-blooded)
Use ¬∃ or equivalently ∀x (Sx → ¬Wx).
Claim D
Not every student passed the exam. (S = is a student, P = passed the exam)
Use ¬∀ or equivalently ∃x (Sx ∧ ¬Px).
Choose one of the arguments above, assign sentence letters, and translate the premises and conclusion into symbolic form.
Quiz
DeductiveScenario Check: Universal and Existential Quantifiers
Each question presents a scenario or challenge. Answer in two to four sentences. Focus on showing that you can use what you learned, not just recall it.
Scenario questions
Work through each scenario. Precise, specific answers are better than long vague ones.
Question 1 — Diagnose
A student makes the following mistake: "Translating universal claims with a conjunction instead of a conditional." Explain specifically what is wrong with this reasoning and what the student should have done instead.
Can the student identify the flaw and articulate the correction?
Question 2 — Apply
You encounter a new argument that you have never seen before. Walk through exactly how you would translate simple universal claims, starting from scratch. Be specific about each step and explain why the order matters.
Can the student transfer the skill of translate simple universal claims to a genuinely new case?
Question 3 — Distinguish
Someone confuses universal quantifier with existential quantifier. Write a short explanation that would help them see the difference, and give one example where getting them confused leads to a concrete mistake.
Does the student understand the boundary between the two concepts?
Question 4 — Transfer
The worked example "All Ravens Are Black" showed one way to handle a specific case. Describe a situation where the same method would need to be adjusted, and explain what you would change and why.
Can the student adapt the demonstrated method to a variation?
Proof Draft
LineStatementJustificationAction
1
2
3
Formalization Practice
DeductiveFormalization Drill: Universal and Existential Quantifiers
Translate each natural-language argument into formal notation. Identify the logical form and check whether the argument is valid.
Practice scenarios
Work through each scenario carefully. Apply the concepts from this lesson.
Argument 1
If the server crashes, then the backup activates. If the backup activates, then an alert is sent. The server crashed. What follows?
Argument 2
Either the contract is valid or the parties must renegotiate. The contract is not valid. What follows?
Argument 3
All databases store records. This system does not store records. What can we conclude about this system?
Choose one of the arguments above, assign sentence letters, and translate the premises and conclusion into symbolic form.
Proof Construction
DeductiveProof Practice: Universal and Existential Quantifiers
Construct a step-by-step proof or derivation for each argument. Justify every step with the rule you are applying.
Practice scenarios
Work through each scenario carefully. Apply the concepts from this lesson.
Prove
From premises: (1) P -> Q, (2) Q -> R, (3) P. Derive R.
Prove
From premises: (1) A v B, (2) A -> C, (3) B -> C. Derive C.
Prove
From premises: (1) ~(P & Q), (2) P. Derive ~Q.
Proof Draft
LineStatementJustificationAction
1
2
3
Evaluation Practice
DeductiveValidity Check: Universal and Existential Quantifiers
Determine whether each argument is deductively valid. If invalid, describe a counterexample where the premises are true but the conclusion is false.
Practice scenarios
Work through each scenario carefully. Apply the concepts from this lesson.
Argument A
All philosophers study logic. Socrates is a philosopher. Therefore, Socrates studies logic.
Argument B
If it rains, the ground is wet. The ground is wet. Therefore, it rained.
Argument C
No birds are mammals. Some mammals fly. Therefore, some things that fly are not birds.
Argument D
Either the door is locked or the alarm is on. The door is not locked. Therefore, the alarm is on.
Proof Draft
LineStatementJustificationAction
1
2
3
Proof Construction
DeductiveDeep Practice: Universal and Existential Quantifiers
Work through these challenging exercises. Each one requires careful application of formal reasoning. Show your work step by step.
Challenging derivations
Prove each conclusion from the given premises. Label every inference rule you use.
Challenge 1
Premises: (1) (A & B) -> C, (2) D -> A, (3) D -> B, (4) D. Derive: C.
Challenge 2
Premises: (1) P -> (Q & R), (2) R -> S, (3) ~S. Derive: ~P.
Challenge 3
Premises: (1) A v B, (2) A -> (C & D), (3) B -> (C & E). Derive: C.
Challenge 4
Premises: (1) ~(P & Q), (2) P v Q, (3) P -> R, (4) Q -> S. Derive: R v S.
Proof Draft
LineStatementJustificationAction
1
2
3
Analysis Practice
DeductiveReal-World Transfer: Universal and Existential Quantifiers
Apply formal logic to real-world contexts. Translate each scenario into formal notation, determine validity, and explain the practical implications.
Logic in the wild
These scenarios come from law, science, and everyday reasoning. Formalize and evaluate each.
Legal reasoning
A contract states: 'If the product is defective AND the buyer reports within 30 days, THEN a full refund will be issued.' The product was defective. The buyer reported on day 35. The company denies the refund. Is the company's position logically valid?
Medical reasoning
A diagnostic protocol states: 'If the patient has fever AND cough, test for flu. If the flu test is negative AND symptoms persist for 7+ days, test for bacterial infection.' A patient has a cough but no fever. What does the protocol require?
Policy reasoning
A policy reads: 'Students may graduate early IF they complete all required courses AND maintain a 3.5 GPA OR receive special faculty approval.' Due to the ambiguity of OR, identify the two possible readings and explain what difference they make.
Proof Draft
LineStatementJustificationAction
1
2
3
Rapid Identification
DeductiveTimed Drill: Universal and Existential Quantifiers
Work through these quickly. For each mini-scenario, identify the logical form, name the rule used, and state whether the inference is valid. Aim for accuracy under time pressure.
Quick-fire logic identification
Identify the logical form and validity of each argument in under 60 seconds per item.
Item 1
If the reactor overheats, the failsafe triggers. The failsafe triggered. Therefore, the reactor overheated.
Item 2
All licensed pilots passed the medical exam. Jenkins is a licensed pilot. Therefore, Jenkins passed the medical exam.
Item 3
Either the encryption key expired or someone changed the password. The encryption key did not expire. Therefore, someone changed the password.
Item 4
If taxes increase, consumer spending decreases. Consumer spending has not decreased. Therefore, taxes have not increased.
Item 5
No insured vehicle was towed. This vehicle was towed. Therefore, this vehicle is not insured.
Item 6
If the sample is contaminated, then the results are unreliable. The sample is contaminated. Therefore, the results are unreliable.
Proof Draft
LineStatementJustificationAction
1
2
3
Evaluation Practice
DeductivePeer Review: Universal and Existential Quantifiers
Below are sample student responses to a logic exercise. Evaluate each response: Is the formalization correct? Is the proof valid? Identify specific errors and suggest corrections.
Evaluate student proofs
Each student attempted to prove a conclusion from given premises. Find and correct any mistakes.
Student A's work
Premises: P -> Q, Q -> R, P. Student wrote: (1) P [premise], (2) P -> Q [premise], (3) Q [MP 1,2], (4) Q -> R [premise], (5) R [MP 3,4]. Conclusion: R. Student says: 'Valid proof by two applications of Modus Ponens.'
Student B's work
Premises: A v B, A -> C. Student wrote: (1) A v B [premise], (2) A -> C [premise], (3) A [from 1], (4) C [MP 2,3]. Conclusion: C. Student says: 'Since A or B is true, A must be true, so C follows.'
Student C's work
Premises: ~P v Q, P. Student wrote: (1) ~P v Q [premise], (2) P [premise], (3) ~~P [DN 2], (4) Q [DS 1,3]. Conclusion: Q. Student says: 'I used double negation then disjunctive syllogism.'
Student D's work
Premises: (P & Q) -> R, P, Q. Student wrote: (1) P [premise], (2) Q [premise], (3) (P & Q) -> R [premise], (4) R [MP 1,3]. Conclusion: R. Student says: 'Modus Ponens with P and the conditional.'
Proof Draft
LineStatementJustificationAction
1
2
3
Proof Construction
DeductiveConstruction Challenge: Universal and Existential Quantifiers
Build complete proofs or arguments from scratch. You are given only a conclusion and some constraints. Construct valid premises and a rigorous derivation.
Build your own proofs
For each task, create a valid argument with explicit premises and step-by-step derivation.
Task 1
Construct a valid argument with exactly three premises that concludes: 'The network is secure.' Use at least one conditional and one disjunction in your premises.
Task 2
Build a valid syllogistic argument that concludes: 'Some scientists are not wealthy.' Your premises must be universal statements (All X are Y or No X are Y).
Task 3
Create a proof using reductio ad absurdum (indirect proof) that derives ~(P & ~P) from no premises. Show every step and justify each with a rule name.
Task 4
Construct a chain of conditional reasoning with at least four steps that connects 'The satellite detects an anomaly' to 'Emergency protocols are activated.' Make each link realistic and name the domain.
Proof Draft
LineStatementJustificationAction
1
2
3
Diagnosis Practice
DeductiveCounterexample Challenge: Universal and Existential Quantifiers
For each invalid argument below, construct a clear counterexample -- a scenario where all premises are true but the conclusion is false. Then explain which logical error the argument commits.
Find counterexamples to invalid arguments
Each argument appears plausible but is invalid. Prove invalidity by constructing a specific counterexample.
Argument 1
If a student studies hard, they pass the exam. Maria passed the exam. Therefore, Maria studied hard.
Argument 2
All roses are flowers. Some flowers are red. Therefore, some roses are red.
Argument 3
No fish can fly. No birds are fish. Therefore, all birds can fly.
Argument 4
If the alarm sounds, there is a fire. The alarm did not sound. Therefore, there is no fire.
Argument 5
All effective medicines have been tested. This substance has been tested. Therefore, this substance is an effective medicine.
Proof Draft
LineStatementJustificationAction
1
2
3
Analysis Practice
DeductiveIntegration Exercise: Universal and Existential Quantifiers
These exercises combine deductive logic with other topics and reasoning styles. Apply formal logic alongside empirical evaluation, explanation assessment, or problem-solving frameworks.
Cross-topic deductive exercises
Each scenario requires deductive reasoning combined with at least one other skill area.
Scenario 1
A quality control team uses this rule: 'If a batch fails two consecutive tests, it must be discarded.' Batch 47 failed Test A and passed Test B, then failed Test C. Formally determine whether the rule requires discarding Batch 47, and discuss whether the rule itself is well-designed from a problem-solving perspective.
Scenario 2
A researcher argues: 'All peer-reviewed studies in this meta-analysis show that X reduces Y. This study shows X reduces Y. Therefore, this study will be included in the meta-analysis.' Evaluate the deductive form, then inductively assess whether the meta-analysis conclusion would be strong.
Scenario 3
An insurance policy states: 'Coverage applies if and only if the damage was caused by a covered peril AND the policyholder reported it within 72 hours.' A policyholder reported water damage after 80 hours, claiming the damage was not discoverable sooner. Apply the formal logic of the policy, then consider whether the best explanation supports an exception.
Scenario 4
A hiring algorithm uses: 'If GPA >= 3.5 AND experience >= 2 years, then advance to interview.' Candidate X has GPA 3.8 and 18 months experience. Formally determine the outcome. Then evaluate: is the algorithm's rule inductively justified? What evidence would you want?
Proof Draft
LineStatementJustificationAction
1
2
3
Diagnosis Practice
DeductiveMisconception Clinic: Universal and Existential Quantifiers
Each item presents a common misconception about deductive logic. Identify the misconception, explain why it is wrong, and provide a correct version of the reasoning.
Common deductive misconceptions
Diagnose and correct each misconception. Explain the error clearly enough for a fellow student to understand.
Misconception 1
A student claims: 'An argument is valid if its conclusion is true. Since the conclusion "Water is H2O" is obviously true, any argument concluding this must be valid.'
Misconception 2
A student says: 'Modus Tollens and denying the antecedent are the same thing. Both involve negation and a conditional, so they must work the same way.'
Misconception 3
A student writes: 'This argument is invalid because the conclusion is false: All cats are reptiles. All reptiles lay eggs. Therefore, all cats lay eggs.'
Misconception 4
A student argues: 'A sound argument can have a false conclusion, because soundness just means the argument uses correct logical rules.'
Misconception 5
A student claims: 'Since P -> Q is equivalent to ~P v Q, we can derive Q from P -> Q alone, without knowing whether P is true.'
Proof Draft
LineStatementJustificationAction
1
2
3
Proof Construction
DeductiveScaffolded Proof: Universal and Existential Quantifiers
Build proofs in stages. Each task gives you a partially completed derivation. Fill in the missing steps, justify each one, and then extend the proof to a further conclusion.
Step-by-step proof building
Complete each partial proof, then extend it. Every step must cite a rule.
Scaffold 1
Premises: (1) (A v B) -> C, (2) D -> A, (3) D. Partial proof: (4) A [MP 2,3]. Your tasks: (a) Complete the proof to derive C. (b) If we add premise (5) C -> E, extend the proof to derive E.
Scaffold 2
Premises: (1) P -> (Q -> R), (2) P, (3) Q. Partial proof: (4) Q -> R [MP 1,2]. Your tasks: (a) Complete the proof to derive R. (b) If we add premise (5) R -> ~S, extend to derive ~S. (c) If we also add (6) S v T, what can you derive?
Scaffold 3
Premises: (1) ~(A & B), (2) A. Your task: Prove ~B step by step. Hint: You may need to use an assumption for indirect proof. Show the subproof structure clearly.
Scaffold 4
Premises: (1) P v Q, (2) P -> R, (3) Q -> S, (4) ~R. Your tasks: (a) Derive ~P from (2) and (4). (b) Using (a), derive Q from (1). (c) Using (b), derive S. (d) Name each rule used.
Proof Draft
LineStatementJustificationAction
1
2
3
Analysis Practice
DeductiveSynthesis Review: Universal and Existential Quantifiers
These exercises require you to combine everything you have learned about deductive reasoning. Each scenario tests multiple skills simultaneously: formalization, rule application, validity checking, and proof construction.
Comprehensive deductive review
Each task combines multiple deductive skills. Show all your work.
Comprehensive 1
A software license agreement states: 'The software may be used commercially if and only if the licensee has purchased an enterprise plan and has fewer than 500 employees, or has received written exemption from the vendor.' Formalize this using propositional logic, determine what follows if a company has an enterprise plan and 600 employees with no exemption, and identify any ambiguity in the original text.
Comprehensive 2
Construct a valid argument with four premises and one conclusion about data privacy. Then create an invalid argument about the same topic that looks similar but commits a formal fallacy. Finally, prove the first is valid and show a counterexample for the second.
Proof Draft
LineStatementJustificationAction
1
2
3
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
- Do not pair universals with conjunctions; the resulting formula overreaches.
- Do not pair existentials with conditionals; the resulting formula is usually vacuously satisfied.
Where students usually go wrong
Translating universal claims with a conjunction instead of a conditional.
Translating existential claims with a conditional instead of a conjunction.
Forgetting that ¬∀ is equivalent to ∃¬ and vice versa.
Mishandling negation scope when a negation is embedded inside a quantifier.
Historical context for this way of reasoning
Gottlob Frege
Frege introduced the universal quantifier as the first primitive of his logic; the existential was defined in terms of the universal and negation. Modern logic treats both as primitive but acknowledges Frege's priority in articulating quantification at all.