Reasoning about necessity and possibility › Why the Barcan Formulas Can Fail
PhilosophyAll chapters Reading tools Notes & comments
Reasoning about necessity and possibility › Why the Barcan Formulas Can FailSection view · Sections in this chapter5 / 9 ↓
In the two countermodels, Kripke uses two worlds accessible from each other and themselves. This makes accessibility an S5 equivalence relation. The failures are therefore possible even with a strong propositional modal logic. The examples turn on the change in domain. In the first, G has domain containing only a, while H includes both a and b. Let P hold of a in both worlds and fail of b in H. Then ∀x □P(x) holds at G. Its one relevant individual, a, satisfies P at every accessible world. But □∀x P(x) fails at G, since H is accessible and b in H fails to satisfy P. That invalidates the Barcan formula ∀x □P(x) → □∀x P(x) for these models.
For the converse, swap the sizes of the domains. G contains a and b, while H contains only a. Let P hold of everyone in each world's local domain, and stipulate that P is false of b at H. Then □∀x P(x) is true at G because every accessible world satisfies the local universal claim. The claim ∀x □P(x) is false at G. Its quantifier ranges over b as well as a, and b fails the modal test at H. This invalidates the converse Barcan formula in the same framework.
The two examples use absence differently. In the first, the new individual b is available at the very world where the universal claim fails. Nothing turns on how P would be evaluated of b in G, where b is absent. In the second, the failure depends on evaluating P at a world where b is absent. Kripke points this out and considers what changes under alternative conventions about truth-values in that case. A logic with fixed domains would remove both changes of population. These countermodels would then be unavailable, since every quantifier would range over the same set for these comparisons.
These examples also show why a countermodel is more informative than saying a formula sounds doubtful. Each world, its domain, and the values or extensions needed for the calculation are specified. To see if the example works, one can ask whom the outermost operator sends us to check, then apply the next operator there. For the two formulas the order of that procedure differs. The resulting truth-values track the difference precisely.
Comments
Add to the conversation
A question, a correction, or an example from your own work.
No comments yet. Be the first to share your thoughts!