Docs / Studies / Studies.DeganoAloni2025

How to be (non-)specific

Degano, M. & Aloni, M. (2025). Linguistics and Philosophy

This file formalizes Degano and Aloni's typology of marked indefinites. An indefinite has three uses, specific known, specific unknown and non-specific, and a marked indefinite is restricted to some of them: of the seven possible restrictions, six are attested and the one covering the specific known and the non-specific use without the specific unknown is not. In two-sorted team semantics a team of assignments to a world variable and an individual variable is the speaker's information state, and the uses are constancy and variation conditions on the individual variable: constancy across the team for specific known, constancy within a world with variation across the team for specific unknown, and variation within a world for non-specific. The three conditions partition the teams.

Each type requires a combination of atoms, and a team meets the requirement exactly when the type's profile lists the use the team renders. A larger team renders a use further from the specific end, constancy passing to subteams and variation to superteams, so the use is a monotone map from the teams to the uses ordered specific known, specific unknown, non-specific, and a requirement is the preimage of its profile. A requirement is therefore convex, a team between two teams meeting it meeting it too, exactly when its profile is an interval of the uses, and only the unattested profile is not. This is the paper's account of the order of Haspelmath's map: the profiles contiguous on the map are those with convex requirements, and of the orderings of the three uses only the map's and its reverse make every contiguous profile convex. Five attested types require a single atom, closed under subteams or under superteams, and the specific unknown type the conjunction of one of each, convex and closed under neither.

German irgend-, Russian koe- and -nibud', Kannada -oo, Italian qualche- and Georgian -γac instantiate the six attested types: the uses are the three specificity functions of Haspelmath's map, the non-specific use being the irrealis function, and a series covers the uses whose functions lie in the region the book draws for it.

TODO

The paper extends the system with negation and modality to derive the licensing of non-specific indefinites and treats epistemic indefinites at length; neither is formalized here.

References

Uses and types

L58–68
L72–80
L82

Conditions on teams

L100–106
L108–117
L132–138

The use a team renders

The three uses partition the teams, so each team renders one, use. A larger team renders a use further from the specific end, constancy passing to subteams and variation to superteams, and a requirement is the set of teams rendering a use of the profile.

L155–158

A requirement is the preimage of its profile under a monotone map from the teams to the uses.

theorem monotone_useL164–170
{V : Type u_1} {E : Type u_2} [DecidableEq E] (v x : V) :
Monotone fun (x_1 : Finset (V → E)) => use x_1 v x

Built from

L172–173
L175–177

Witnesses

Over a domain with two individuals a and b each use has a team: one assignment for the specific known use, the two constant assignments for the specific unknown use, and those two with a variant of the first at the individual variable for the non-specific use.

Convexity

A requirement is the preimage of its profile under use, which is monotone and has a monotone section. So a requirement is convex, closed under subteams or closed under superteams exactly when its profile is, and one requirement entails another exactly when its profile is included in the other's.

L225–230

A type's requirement is convex exactly when its uses form an interval, so convexity over teams is convexity over the uses.

theorem IndefiniteType.ordConnected_requires_iffL238–246
{V : Type u_1} {E : Type u_2} {v x : V} {t : IndefiniteType} [Nontrivial E] (hvx : v ≠ x) :
{T : Finset (V → E) | Requires T v x t}.OrdConnected ↔ (↑t.profile).OrdConnected

Built from , ,

L248–254
L256–262
L264–270
L272–274

Monotonicity

A constancy atom is closed under subteams and a variation atom under superteams. The specific unknown requirement, the conjunction of one of each, is convex and closed under neither, since its use lies strictly between the other two.

L282–286
L288–292

The types on the map

A type's requirement is convex exactly when its uses form a connected region of the map, so convexity over teams is contiguity on the map.

theorem ordConnected_requires_iff_connectedL312–318
{V : Type u_1} {E : Type u_2} [Nontrivial E] {v x : V} (hvx : v ≠ x) {t : IndefiniteType} :
{T : Finset (V → E) | IndefiniteType.Requires T v x t}.OrdConnected ↔ (SimpleGraph.induce (↑(Finset.image Indefinite.SpecificityFunction.toFunction t.profile)) Indefinite.implicationalMap).Connected

Built from , ,

The map orders the uses as convexity requires. On an ordering σ of the three uses, every type whose uses are contiguous has a convex requirement exactly when σ is the map's order or its reverse; on any other ordering the specific known and the non-specific use are contiguous, and their disjunction is not convex.

theorem forall_ordConnected_requires_iffL329–339
{V : Type u_1} {E : Type u_2} [Nontrivial E] {v x : V} (hvx : v ≠ x) (σ : Indefinite.SpecificityFunction ≃ Fin 3) :
(∀ (t : IndefiniteType), (⇑σ '' ↑t.profile).OrdConnected → {T : Finset (V → E) | IndefiniteType.Requires T v x t}.OrdConnected) ↔ Monotone ⇑σ ∨ Antitone ⇑σ

Built from , ,

Every series of the sample covering one of the three uses instantiates a type with a convex requirement, since it covers a connected region of the map.

theorem sample_instantiates_ordConnectedL341–349
{V : Type u_1} {E : Type u_2} (v x : V) (p : List Haspelmath1997.Series) :
p ∈ Haspelmath1997.sample → ∀ s ∈ p, (Indefinite.specificityFunctions s.functions).Nonempty → ∃ (t : IndefiniteType), Instantiates s t ∧ {T : Finset (V → E) | IndefiniteType.Requires T v x t}.OrdConnected

Built from , ,

L351–364