What Is Modal Logic?

01First-Pass Modal CheckQuiz

Quiz

Deductive

First-Pass Modal Check

Answer each short question in one or two sentences. These questions check that you can articulate the basic ideas in your own words before moving to notation.

Check questions

Write short answers in your own words. A good answer uses the vocabulary of necessity and possibility without leaning on the textbook definitions verbatim.

Question 1

Give one example of a contingent truth and explain what makes it contingent rather than necessary.

A good example is a fact that could easily have been otherwise.

Question 2

Why can propositional logic alone not distinguish necessary truths from merely actual ones?

Think about what propositional logic can and cannot see about a claim.

Question 3

If someone says 'the winner must have cheated', is that an epistemic or a metaphysical use of 'must'? How do you know?

Ask whether the speaker is talking about their evidence or about the way the world could have been.

Question 4

In your own words, what is a possible world, and how does appealing to possible worlds help make the word 'necessary' more precise?

You do not have to give a formal definition; a careful plain-English answer is enough.

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

02Contingent, Necessary, or Impossible?Classification Practice

Classification Practice

Deductive

Contingent, Necessary, or Impossible?

For each claim, decide whether the speaker is treating it as contingent (true but could have been false), necessary (could not have been false), or impossible (could not have been true). Justify each classification by appealing to whether the claim could have turned out differently.

Claims to classify

Take each claim in the spirit it is offered. Do not argue over whether the claim is true; instead, ask what kind of truth the speaker is attributing to it.

Claim A

Water is H2O.

Scientific identity claims are a classic case: once established, they are usually treated as necessary rather than merely actual.

Claim B

The coffee shop on the corner closes at nine.

Ask whether the hours could easily have been different; that is the test for contingency.

Claim C

There is a prime number between twenty and thirty.

Mathematical truths are typically treated as necessary: if true at all, they are true in every possible world.

Claim D

There is a round square in the back garden.

If the description is self-contradictory, the claim is impossible and deserves a different label than a merely false claim.

Claim E

The current president of France is over forty years old.

Descriptions that depend on the actual holder of an office usually track a contingent fact, not a necessary one.

Claim F

Two plus two equals four.

Consider how the claim would fare across possible worlds, not just in this one.

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

03Timed Drill: What Is Modal Logic?Rapid Identification

Rapid Identification

Deductive

Timed Drill: What Is Modal Logic?

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.

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

04Formalization Drill: What Is Modal Logic?Formalization Practice

05Real-World Transfer: What Is Modal Logic?Analysis Practice

Analysis Practice

Deductive

Real-World Transfer: What Is Modal Logic?

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.

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

06Integration Exercise: What Is Modal Logic?Analysis Practice

Analysis Practice

Deductive

Integration Exercise: What Is Modal Logic?

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?

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

07Synthesis Review: What Is Modal Logic?Analysis Practice

Analysis Practice

Deductive

Synthesis Review: What Is Modal Logic?

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.

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

08Validity Check: What Is Modal Logic?Evaluation Practice

09Peer Review: What Is Modal Logic?Evaluation Practice

Evaluation Practice

Deductive

Peer Review: What Is Modal Logic?

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.'

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

10Counterexample Challenge: What Is Modal Logic?Diagnosis Practice

11Misconception Clinic: What Is Modal Logic?Diagnosis Practice

Diagnosis Practice

Deductive

Misconception Clinic: What Is Modal Logic?

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.'

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

12Proof Practice: What Is Modal Logic?Proof Construction

13Deep Practice: What Is Modal Logic?Proof Construction

14Construction Challenge: What Is Modal Logic?Proof Construction

15Scaffolded Proof: What Is Modal Logic?Proof Construction

Proof Construction

Deductive

Scaffolded Proof: What Is Modal Logic?

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.

Type these symbols: ~ = ¬ not · & = ∧ and · | = ∨ or · -> = → if-then · <-> = ↔ iff · variables: P, Q, R...

How to fill this out

Premises (top box): note the assumptions for your own thinking. The graded record is the rows below — repeat each premise there as line 1, 2, ... with Justification = "Premise".
Goal: the formula you intend to derive on the final line.
Proof rows: one row per step. Statement is the formula. Justification says how you got it:
- For an assumption: type Premise
- For a derived line, name the rule and the lines it uses:Modus Ponens from 1, 2 · MT 3, 4 · DeM 5
Watch the badges next to each row. Verified means the inference checks out. An error names what didn't fit.
Click Show me an example if you want a complete sample loaded into the form.

Premises (scratch space)Goal (formula to derive)

Proof Draft

LineStatementJustificationAction

1

2

3

Not saved yet.

What Is Modal Logic?

What this lesson is helping you do

Read the explanation

Study the worked example

Try the practice

The three modal categories: necessary, contingent, and impossible

Box and diamond informally

Modal vocabulary in ordinary language

Possible worlds: the informal picture

Why classical logic is not enough

Where the lesson is going

Keep these in view

Open when you need the extra structure

Reading a Sentence with a Modal Auxiliary

Mathematical Truth and the Necessity Test

Epistemic versus Metaphysical 'Must': The Detective Case

The Round Square: Impossibility versus Mere Falsehood

First-Pass Modal Check

Truth-Table Builder

Proof Constructor

Animated Explainers