Docs / Studies / Studies.Thomason1984

Combinations of Tense and Modality

Thomason, R. H. (1984). In Handbook of Philosophical Logic (pp. 205–234). Kluwer Academic Publishers

On a T × W frame the worlds share one time order, and worlds are historical alternatives through a time when they differ only in what is future to it. Thomason makes atoms respect this: an assignment treats alternatives alike up to and including the time, which holds of a valuation exactly when the frame refines the agreement of worlds on its atoms up to each time. Then a formula without the future tense is historically necessary when true and the past of a necessity is a necessity of the past, while the converse fails. Since every world has the same times, whether a last moment lies ahead and whether none does are historically necessary too.

Implementation notes

  • Thomason's □ is historical necessity, Formula.N; Formula.box is not in his language.
  • The chapter was read in the second edition of the Handbook (2002, vol. 7), whose pages the locators give, which reprints it with bracketed editorial updates.

TODO

  • Treelike frames and Ockhamist validity (Definitions 1 to 5), which validate (6) and (7) but not (15) and (16). Kamp frames and their axioms (Definition 9), neutral frames (Definition 10), and the deontic section.

References

Declarations

L46–49

A valuation is an assignment of a frame exactly when the frame's historical equivalence refines agreement on the valuation's atoms up to each time, so TWFrame.ofDatedFacts is the coarsest frame for which the valuation is an assignment.

theorem isAssignment_iff_sim_leL51–58
{T : Type u_1} {World : Type u_2} {Atom : Type u_3} [LinearOrder T] {F : Temporal.TWFrame World T} {V : Atom → T → World → Prop} :
IsAssignment F V ↔ ∀ (t : T), F.sim t ≤ (Temporal.TWFrame.ofDatedFacts Prod.snd fun (w : World) (f : Atom × T) => V f.1 f.2 w).sim t

Built from

Under an assignment, a formula without the future tense is historically necessary exactly when it is true (p. 209).

theorem sat_N_iff(6)L92–97
{T : Type u_1} {World : Type u_2} {Atom : Type u_3} [LinearOrder T] {F : Temporal.TWFrame World T} {V : Atom → T → World → Prop} {a : Temporal.Formula Atom} {t : T} {w : World} (hV : IsAssignment F V) (ha : ContainsNoF a) :
F.sat V a.N { world := w, time := t } ↔ F.sat V a { world := w, time := t }

Built from ,

(8) is invalid (p. 209): it can have been that something would happen, on every alternative, while at no earlier time was it settled that it would. The countermodel is an assignment, on a frame of dated facts.

theorem exists_not_N_past_imp_past_NL117–138
:
∃ (F : Temporal.TWFrame Bool ℕ) (V : Unit → ℕ → Bool → Prop), IsAssignment F V ∧ F.sat V (Temporal.Formula.atom ()).Fut.Pst.N { world := true, time := 1 } ∧ ¬F.sat V (Temporal.Formula.atom ()).Fut.N.Pst { world := true, time := 1 }

Built from