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 more→→Formal 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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → Modal Semantics: Necessity and Possibility → Intensionality and Possible Worlds Semantics → Event Semantics → Aktionsart (Lexical Aspect) → Tense and Aspect in Formal Semantics → Viewpoint Aspect (Perfective and Imperfective) → Formal Semantics of Tense and Time

Longest path: 104 steps · 652 total prerequisite topics

Prerequisites (6)

Leads To (2)