A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Formal Semantics of Tense and Time

Graduate Depth 103 in the knowledge graph I know this Set as goal
84topics build on this
652prerequisites beneath it
See this on the map →
Semantic Types and Compositional MeaningEvent Semantics: Formal Representation of Eventualities+4 moreFormal Semantics of Modality and PossibilityPresupposition in Formal Semantics
semantics tense logic

Core Idea

Temporal logic formalizes the semantics of tense by quantifying over time intervals and assigning truth values relative to moments. Past, present, and future tenses are formalized as assertions about when events hold relative to the speech time.

Explainer

From your work with semantic types and composition, you know that sentences are evaluated relative to a model — they denote functions from possible worlds to truth values. But the same sentence, "It is raining," is true at some times and false at others. A model that ignores time is underdetermined. The formal solution is to extend the evaluation index: instead of evaluating a sentence at a world w alone, we evaluate it at a world-time pair ⟨w, t⟩, where t is a point or interval on a timeline. The present tense is the default: the formula is evaluated at the speech time S, the moment of utterance.

The simplest formal treatment, following Prior's tense logic, introduces two sentential operators analogous to modal operators. The past operator P and future operator F quantify over times: P(φ) is true at time t if there exists some time t' < t at which φ is true; F(φ) is true at t if there exists some t' > t at which φ is true. These operators compose: PP(φ) — "it was the case that it had been the case that φ" — describes a doubly past event, as in the pluperfect. The formal machinery is identical in structure to modal logic over possible worlds, with time replacing worlds and temporal precedence replacing the accessibility relation.

A more fine-grained account, following Reichenbach, distinguishes three independent reference points: the speech time S (when the utterance occurs), the event time E (when the described event actually occurs), and the reference time R (a temporal perspective point from which the event is viewed). Each tense can be characterized by the ordering of these three points. Simple past: E and R before S — the event occurred, and we view it from the same past vantage. Past perfect: E before R, R before S — the event occurred before a past reference point, as in "She had left before I arrived" (E=leaving, R=arriving, both before S). Simple future: S before R and E — the event is ahead of now. These orderings predict the felicity conditions for each tense in discourse.

The formal treatment of aspect — the distinction between simple past "she ran" (event viewed as completed) and past progressive "she was running" (event viewed as ongoing at a reference time) — requires moving from point-based to interval-based models. Events with duration are true throughout an interval; culminating events are true only at a point. In compositional semantics, this connects directly to the type system you know: predicates can take event variables (of type *e* over eventualities), and tense operators bind those variables to positions on the timeline relative to S and R. The semantics of tense is thus the semantics of quantification, applied to a temporal domain rather than an individual-level one.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraIntroduction to Propositional LogicIntroduction to Predicate Logic (First-Order Logic)First-Order Logic SyntaxTerms and Atomic Formulas in FOLVariable Binding and ScopeOpen and Closed Formulas in First-Order LogicVariable Substitution and Capture-Avoidance in First-Order LogicQuantifier Instantiation Rules in First-Order Proof SystemsUniversal Quantification: Meaning and ScopeFree Variables and Bound VariablesSubstitution and Instantiation in Predicate LogicTerms and Atomic FormulasFormulas and Well-Formed ExpressionsStructures and InterpretationsModel Interpretation and SatisfactionInterpretation, Truth, and Satisfaction of FormulasLogical Consequence and EntailmentSoundness Theorem and Validity of Proof SystemsDeductive Reasoning and Formal Proof SystemsFirst-Order ResolutionPropositional ResolutionSemantic Tableaux (Propositional)Semantic Tableaux (First-Order)Decidable Fragments of First-Order LogicGödel's Completeness Theorem for First-Order LogicGödel's Incompleteness TheoremsIntroduction to Intuitionistic LogicIntroduction to Modal LogicModal Semantics: Necessity and PossibilityIntensionality and Possible Worlds SemanticsEvent SemanticsAktionsart (Lexical Aspect)Tense and Aspect in Formal SemanticsViewpoint Aspect (Perfective and Imperfective)Formal Semantics of Tense and Time

Longest path: 104 steps · 652 total prerequisite topics

Prerequisites (6)

Leads To (2)