Persistence levels #
Grimm replaces Dowty's five Proto-Patient entailments by four persistence features, existential
and qualitative persistence at the beginning and at the end of the event. Their logical
dependencies, that an entity that exists does so with its qualities and that nonexistence at a
boundary erases them, leave five valid combinations, ordered by inclusion: a lattice with a
creation branch (exPersEnd) and an affectedness branch (exPersBeginning ≤ quPersBeginning)
rejoining at totalPersistence.
Main definitions #
PersistenceLevel.Feature: the four persistence features.PersistenceLevel: the five valid combinations, each a set of features.PersistenceLevel.Valid: Grimm's exclusion principles, withrange_featuresshowing that the five levels are exactly the combinations they leave.
Implementation notes #
A level is SetLike over its features, so its order is inclusion. Grimm's first principle, that
some qualitative persistence accompanies existential persistence, is read as qualitative
persistence at the beginning with existence there and some qualitative persistence with existence
at the end; this is the reading under which exactly five combinations remain, as the paper says.
The levels are closed under union but not under intersection, so the meet is the largest level
inside the intersection, given by a table.
References #
The five valid persistence levels ([Gri11] pp.524–525, Fig. 2).
- totalNonPersistence : PersistenceLevel
No entailed existence, as for the arguments of seek, want and negated copulas.
- exPersEnd : PersistenceLevel
The entity comes into existence, as the objects of build, invent and the subject of appear do.
- exPersBeginning : PersistenceLevel
The entity exists before the event and ceases to, as the subjects of die, evaporate and the objects of destroy, ruin do.
- quPersBeginning : PersistenceLevel
The entity persists but is qualitatively changed, as the objects of transitive move, dim, frighten and the intransitive subject of fall are.
- totalPersistence : PersistenceLevel
The entity persists unchanged throughout, as prototypical transitive subjects and the unaffected objects of see and cut at do.
Instances For
Equations
- ArgumentStructure.instDecidableEqPersistenceLevel x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
Equations
- One or more equations did not get rendered due to their size.
The four persistence features ([Gri11] Table 2).
- exPB : Feature
Existential persistence at the beginning of the event.
- exPE : Feature
Existential persistence at the end of the event.
- quPB : Feature
Qualitative persistence at the beginning of the event.
- quPE : Feature
Qualitative persistence at the end of the event.
Instances For
Equations
- ArgumentStructure.PersistenceLevel.instDecidableEqFeature x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
Equations
- One or more equations did not get rendered due to their size.
The features of a level.
Equations
- One or more equations did not get rendered due to their size.
- ArgumentStructure.PersistenceLevel.totalNonPersistence.features = ∅
- ArgumentStructure.PersistenceLevel.exPersEnd.features = {ArgumentStructure.PersistenceLevel.Feature.exPE, ArgumentStructure.PersistenceLevel.Feature.quPE}
- ArgumentStructure.PersistenceLevel.exPersBeginning.features = {ArgumentStructure.PersistenceLevel.Feature.exPB, ArgumentStructure.PersistenceLevel.Feature.quPB}
Instances For
Grimm's exclusion principles on persistence features: qualities persist at a boundary only where the entity exists there, existence at the beginning brings qualitative persistence at the beginning, and existence at the end brings some qualitative persistence.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
The five levels are exactly the combinations of features the exclusion principles leave.
Equations
- One or more equations did not get rendered due to their size.
Equations
- ArgumentStructure.PersistenceLevel.instPartialOrder = PartialOrder.ofSetLike ArgumentStructure.PersistenceLevel
Equations
- l.instDecidablePredFeatureMem f = Finset.decidableMem f l.features
Equations
- x✝¹.instDecidableRelLe x✝ = decidable_of_iff (x✝¹.features ⊆ x✝.features) ⋯
The join of two levels, the level whose features are the union of theirs.
Equations
- ArgumentStructure.PersistenceLevel.totalNonPersistence.sup' x✝ = x✝
- x✝.sup' ArgumentStructure.PersistenceLevel.totalNonPersistence = x✝
- ArgumentStructure.PersistenceLevel.totalPersistence.sup' x✝ = ArgumentStructure.PersistenceLevel.totalPersistence
- x✝.sup' ArgumentStructure.PersistenceLevel.totalPersistence = ArgumentStructure.PersistenceLevel.totalPersistence
- ArgumentStructure.PersistenceLevel.exPersBeginning.sup' ArgumentStructure.PersistenceLevel.exPersBeginning = ArgumentStructure.PersistenceLevel.exPersBeginning
- ArgumentStructure.PersistenceLevel.exPersEnd.sup' ArgumentStructure.PersistenceLevel.exPersEnd = ArgumentStructure.PersistenceLevel.exPersEnd
- ArgumentStructure.PersistenceLevel.quPersBeginning.sup' ArgumentStructure.PersistenceLevel.quPersBeginning = ArgumentStructure.PersistenceLevel.quPersBeginning
- ArgumentStructure.PersistenceLevel.exPersBeginning.sup' ArgumentStructure.PersistenceLevel.quPersBeginning = ArgumentStructure.PersistenceLevel.quPersBeginning
- ArgumentStructure.PersistenceLevel.quPersBeginning.sup' ArgumentStructure.PersistenceLevel.exPersBeginning = ArgumentStructure.PersistenceLevel.quPersBeginning
- ArgumentStructure.PersistenceLevel.exPersBeginning.sup' ArgumentStructure.PersistenceLevel.exPersEnd = ArgumentStructure.PersistenceLevel.totalPersistence
- ArgumentStructure.PersistenceLevel.exPersEnd.sup' ArgumentStructure.PersistenceLevel.exPersBeginning = ArgumentStructure.PersistenceLevel.totalPersistence
- ArgumentStructure.PersistenceLevel.exPersEnd.sup' ArgumentStructure.PersistenceLevel.quPersBeginning = ArgumentStructure.PersistenceLevel.totalPersistence
- ArgumentStructure.PersistenceLevel.quPersBeginning.sup' ArgumentStructure.PersistenceLevel.exPersEnd = ArgumentStructure.PersistenceLevel.totalPersistence
Instances For
The meet of two levels, the largest level inside the intersection of their features.
Equations
- ArgumentStructure.PersistenceLevel.totalPersistence.inf' x✝ = x✝
- x✝.inf' ArgumentStructure.PersistenceLevel.totalPersistence = x✝
- ArgumentStructure.PersistenceLevel.totalNonPersistence.inf' x✝ = ArgumentStructure.PersistenceLevel.totalNonPersistence
- x✝.inf' ArgumentStructure.PersistenceLevel.totalNonPersistence = ArgumentStructure.PersistenceLevel.totalNonPersistence
- ArgumentStructure.PersistenceLevel.exPersBeginning.inf' ArgumentStructure.PersistenceLevel.exPersBeginning = ArgumentStructure.PersistenceLevel.exPersBeginning
- ArgumentStructure.PersistenceLevel.exPersEnd.inf' ArgumentStructure.PersistenceLevel.exPersEnd = ArgumentStructure.PersistenceLevel.exPersEnd
- ArgumentStructure.PersistenceLevel.quPersBeginning.inf' ArgumentStructure.PersistenceLevel.quPersBeginning = ArgumentStructure.PersistenceLevel.quPersBeginning
- ArgumentStructure.PersistenceLevel.exPersBeginning.inf' ArgumentStructure.PersistenceLevel.quPersBeginning = ArgumentStructure.PersistenceLevel.exPersBeginning
- ArgumentStructure.PersistenceLevel.quPersBeginning.inf' ArgumentStructure.PersistenceLevel.exPersBeginning = ArgumentStructure.PersistenceLevel.exPersBeginning
- ArgumentStructure.PersistenceLevel.exPersBeginning.inf' ArgumentStructure.PersistenceLevel.exPersEnd = ArgumentStructure.PersistenceLevel.totalNonPersistence
- ArgumentStructure.PersistenceLevel.exPersEnd.inf' ArgumentStructure.PersistenceLevel.exPersBeginning = ArgumentStructure.PersistenceLevel.totalNonPersistence
- ArgumentStructure.PersistenceLevel.exPersEnd.inf' ArgumentStructure.PersistenceLevel.quPersBeginning = ArgumentStructure.PersistenceLevel.totalNonPersistence
- ArgumentStructure.PersistenceLevel.quPersBeginning.inf' ArgumentStructure.PersistenceLevel.exPersEnd = ArgumentStructure.PersistenceLevel.totalNonPersistence
Instances For
The features of a join are the union of the features.
Equations
- One or more equations did not get rendered due to their size.
Equations
- One or more equations did not get rendered due to their size.