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.
Modal And Intensional Logic
Reasoning about what must, might, and could have been
Students learn to reason about necessity, possibility, and counterfactual conditionals using the box and diamond operators, possible-world semantics, and the Lewis-Stalnaker treatment of would-conditionals. They also learn to formalize de dicto and de re modal claims and to apply modal reasoning to philosophical, ethical, and scientific arguments.
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
Introduces modality as a step beyond truth-functional logic, explains the difference between actual and necessary truth, and gives an informal first look at the box and diamond operators.
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 box and diamond operators formally, establishes the duality between them, and presents the core modal axioms K and T together with simple rules of necessity elimination and possibility introduction.
Use the reading and examples to learn what the standards demand, then practice applying those standards explicitly in 15 activitys.
Trains students to translate natural-language modal arguments into box and diamond notation and to recognize de dicto and de re scope distinctions in quantified modal claims.
Read for structure first, inspect how the example turns ordinary language into cleaner form, then complete 15 formalization exercises yourself.
Introduces the Lewis-Stalnaker nearness semantics for counterfactual conditionals, distinguishes 'would' from 'might' conditionals, and explains why counterfactuals resist strengthening the antecedent.
Use the reading and examples to learn what the standards demand, then practice applying those standards explicitly in 15 activitys.
Students apply the unit's modal concepts to arguments in metaphysics, ethics, and science, analyzing cases that each require multiple unit concepts working together.
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 the necessity of (P -> Q), infer that the necessity of P implies the necessity of Q; in symbols, box(P -> Q) -> (boxP -> boxQ).
Common failures
From boxP, infer P; if a proposition is necessary, it is actually true.
Common failures
From boxP, infer box boxP; if a proposition is necessary, it is necessary that it is necessary.
Common failures
From diamondP, infer box diamondP; if a proposition is possible, it is necessarily possible.
Common failures
From boxP, infer P in the current world; this is the same licensed move as axiom T when T is part of the system.
Common failures
From P, infer diamondP; whatever is actually the case is possible.
Common failures
Proper names pick out the same object in every possible world in which that object exists, so an identity between rigid designators, if true, is necessarily true.
Common failures
Unlike the material conditional, counterfactuals do not allow strengthening the antecedent: from 'if it had been P, it would have been Q' you cannot always infer 'if it had been P and R, it would have been Q'.
Common failures
boxP is true at world w if and only if P is true at every world accessible from w; diamondP is true at w if and only if P is true at some world accessible from w.
Common failures
Formalization Patterns
Input form
natural_language_modal_claim
Output form
modal_formula
Steps
Common errors
Input form
modal_formula
Output form
labeled_world_diagram
Steps
Common errors
Concept Map
A proposition is necessary when it is true in every possible world; written as the box operator in front of the proposition.
A proposition is possible when it is true in at least one possible world; written as the diamond operator in front of the proposition.
A complete way things could consistently be, usually represented as a point in a model at which every proposition has a definite truth value.
A relation between possible worlds that says which worlds count as 'available' from a given world when evaluating modal operators.
A term that picks out the same object in every possible world in which that object exists, as opposed to terms whose reference can shift across worlds.
A conditional of the form 'if it had been the case that P, it would have been the case that Q', evaluated by looking at the nearest possible worlds where P is true.
De dicto modal claims are about the modality of a whole proposition; de re modal claims are about a modal property attributed to a particular thing.
The equivalence between box and diamond via negation: the box of P is equivalent to not the diamond of not P, and vice versa.
Assessment
Assessment advice
Mastery requirements
History Links
Developed the first systematic account of modal syllogisms, distinguishing necessary from contingent premises and raising questions about how modality interacts with the subject and predicate of a claim.
Founded modern symbolic modal logic with the systems S1 through S5, introducing a primitive notion of strict implication to replace the material conditional as an account of entailment.
Developed possible-world semantics with an explicit accessibility relation, making modal logic model-theoretic and providing completeness results for standard modal systems.
Proposed a semantics for counterfactual conditionals based on nearness of possible worlds and defended a controversial modal realism in which all possible worlds are equally real.
Developed the first quantified modal logic and defended the rigidity of proper names and the necessity of identity, setting the stage for later work by Kripke and others.