Docs / Logic / Temporal / PointAlgebra

The point algebra

import Linglib.Logic.Temporal.PointAlgebra

An element of the point algebra of Vilain & Kautz 1986 is a set of the orderings in which one point of a linear order may stand to another, read as the disjunction of the relations <, = and > that it contains. Elements form a Boolean algebra with a converse and a composition whose unit is {eq}; composition distributes over joins, which the IdemSemiring instance records. Each element is a relation on any ordered type. On a linear order with two points the relations order as the elements do, and passing to the relation preserves joins, complements and converses. The relation of a product contains the composite of the relations, and is the composite for all elements exactly when the order is dense and has no least or greatest point, where the algebra is that of the relations definable from <.

References

Declarations

L29–32
L32
L42–43
L45
L47
L49
L51
L53
L55

Composition

L62–64
L66
L68–70
L94
L96

Converse

L105–108
L110–112

The relation of an element

The relation of an element relates a point to the points that stand to it in one of the element's orderings.

def PointAlgebra.toSetRelL122–124
{T : Type u_1} [LT T] (C : PointAlgebra) :
SetRel T T
  • C.toSetRel = {p : T × T | ∃ o ∈ C, o.Compares p.2 p.1}

Built from

Instances Tense.instIsTransToSetRelDenotePointAlgebraFuture, Tense.instIsTransToSetRelDenotePointAlgebraPast

Used by PointAlgebra.mem_toSetRel, PointAlgebra.mem_toSetRel_lt, PointAlgebra.mem_toSetRel_gt, PointAlgebra.mem_toSetRel_one, PointAlgebra.toSetRel_one, PointAlgebra.mem_toSetRel_top, PointAlgebra.toSetRel_bot, PointAlgebra.toSetRel_sup, PointAlgebra.toSetRel_mono, PointAlgebra.toSetRel_inv, PointAlgebra.toSetRel_lt_subset_comp_self_iff, PointAlgebra.toSetRel_gt_subset_comp_self_iff, PointAlgebra.mem_toSetRel_top_iff_le, PointAlgebra.instIsTransToSetRelSingletonOrdering, PointAlgebra.instIsTransToSetRelSingletonOrdering_1, PointAlgebra.mem_toSetRel_iff, PointAlgebra.instDecidableMemProdSetRelToSetRelMk, PointAlgebra.toSetRel_top, PointAlgebra.toSetRel_subset_toSetRel_iff, PointAlgebra.toSetRel_injective, PointAlgebra.toSetRel_compl, PointAlgebra.toSetRel_comp_subset, PointAlgebra.toSetRel_mul, PointAlgebra.toSetRel_mul_iff

Used in Logic/Temporal/Defs, Semantics/Modality/BranchingTime, Semantics/Modality/HistoricalAlternatives, Semantics/Tense/Defs, Semantics/Tense/Pronoun and 8 more

L126
L128–129
L131–132
L134–135
L137–139
L141–143
L145–146
L162–169
L171–178
L182–191
L193–194
L196–197
L203–204
L208–210
L212–217
L219–220
L234–236
L247–253

The relation of a product is the composite of the relations for all elements exactly when the order is dense and has no least or greatest point: density comes from < composed with itself, and a point below and above each point from < composed with >, which is ⊤.

theorem PointAlgebra.toSetRel_mul_iffL255–268
{T : Type u_1} [LinearOrder T] :
(∀ (C D : PointAlgebra), (C * D).toSetRel = C.toSetRel.comp D.toSetRel) ↔ DenselyOrdered T ∧ NoMinOrder T ∧ NoMaxOrder T

Built from ,