Numbers as kinds: Polymorphic Contextualism #
@cite{snyder-2026}
@cite{snyder-2026} (L&P 49:57-100) argues that the lexical meaning of two
is an atomic predicate λxα. two(x) that applies to different countable
entities (numeral tokens, kinds, subkinds of TWO) in different contexts;
all other meanings derive via Partee type-shifting. This generalises and
strictly subsumes two earlier analyses Snyder labels:
- Polymorphic Substantivalism: lexical
[[two]] = 2is a numeral (entity of typee); cardinal predicates derive via CARD; all else via type-shifting. (@cite{landman-2004}; @cite{scontras-2014}; @cite{snyder-2017}.) - Polymorphic Adjectivalism: lexical
[[two]] = λx. μ#(x) = 2is a cardinality predicate; numerals derive via NOM + Rothstein's Schematic Equation. (@cite{partee-1987}; @cite{geurts-2006}; @cite{rothstein-2013}; @cite{rothstein-2017}; @cite{kennedy-2015}; @cite{bylinina-nouwen-2020}.) - Polymorphic Contextualism (@cite{snyder-2026}): lexical
[[two]] = λxα. two(x)is an atomic predicate over relativized atoms; all meanings derive via type-shifting (CARD/PM/A/NOM/IOTA), including taxonomic, kind-, and token-referential uses the first two analyses miss.
The diagram from §5 (76a-j):
CARD PM
(76g),(76i),(76e) ───→ (76a) ───→ (76b)
↑ IOTA │ │
│ NOM A
│ ↓ ↓
λxα. two(x) (76d) (76c)
↓ PM + IOTA
(76h),(76j),(76f) — close appositives
Architecture #
Theories/Semantics/Kinds/Subkinds.lean— substrate: kind formation by salient equivalence relation (= mathlib'sSetoid); Carlson's Disjointness Condition. Snyder's account of why TWO has disjoint subkinds2_ℕ, 2_ℤ, 2_ℚ, 2_ℝ(§4.3, §5) instantiates the Mendia framework via the localkfTWO : Setoid TwoTokenpartition (defined below).- This file additionally implements Snyder's §6-§7 colour-word extension
via a second local Mendia partition
kfRed : Setoid ColorToken, consuming the Dutch adjective Fragment for colour roots. Phenomena/Morphology/Studies/McNallyDeSwart2011.leanis a sibling Mendia consumer, withkfShade : Setoid Shadepartitioning Dutch colour and taste shades by adjective root. Together with the two partitions in this file, the Mendia substrate now has three consumers (numerals + Snyder colours + M&deS colours/tastes), genuinely cross-domain. All four partitions follow the project-widekf{Carrier}naming convention.
The two colour analyses (Snyder §6 here vs M&deS over there) are
competing — they consume the same Mendia substrate (subkindOf) and
agree on iota for definites, but disagree on lexical-projection
architecture (Snyder: unitary λxα. red(x) over relativized atoms;
M&deS: distinct rood_N vs rood_A projected from a shared root) and
on nominalisation operator (Snyder: Partee NOM as typed shifter; M&deS:
Chierchia ∩ carried by het). Having both formalised makes the
divergence load-bearing instead of docstring-only.
This file:
- Models the three analyses' lexical types and the nine semantic functions'
target types as a small inductive
SemTy(e,et,ett). - Gives each Partee/Snyder operator a typed signature; a derivation path is well-typed iff its operator chain composes from lexical type to target type. Coverage theorems then witness type-checking results, not just table lookup.
- Instantiates the Mendia framework over a
TwoTokencarrier with multiple tokens per number system, sodisjointness_conditiondoes real work in the Identification-Problem theorem. - Uses a real Sharvy iota for close appositives — the (16b)
[[the N₁ N₂]] = ιx[N₁(x) ∧ N₂(x)]clause carries a uniqueness presupposition, modelled as a partialOption-valued operation.
The Identification Problem (@cite{benacerraf-1965}; @cite{snyder-2026} §3.1, §5.2; @cite{snyder-2025}) is dissolved by derivation from the substrate: distinct equivalence classes of TWO under the salient partition are disjoint, so close-appositive iota over modifier-restricted subkinds yields distinct referents whenever the uniqueness presupposition is satisfied. Cf. @cite{moltmann-2013}, @cite{hofweber-2005}, @cite{rieppel-2021} for rival treatments of close-appositive coreference, and @cite{anderson-morzycki-2015} for the Degrees-as-Kinds view Snyder adopts in §5.3.
Semantic types #
A small fragment of the Heim & Kratzer / Partee type system, sufficient to
carry the Snyder paths. PM is treated monadically (et → et) — the
implicit second predicate is supplied at the syntax level.
Equations
- Phenomena.Numerals.Snyder2026.instDecidableEqSemTy x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
§2-3, §5: the three polymorphic analyses #
The three polymorphic analyses Snyder distinguishes — labels verbatim from @cite{snyder-2026} §2-3.
- substantivalism : PolymorphicAnalysis
Lexical
[[two]] = 2 : e(a numeral entity), §2 (5). - adjectivalism : PolymorphicAnalysis
Lexical
[[two]] = λx. μ#(x) = 2 : et(a cardinality predicate), §2 (9). - contextualism : PolymorphicAnalysis
Lexical
[[two]] = λxα. two(x) : et(an atomic predicate over relativized atoms), §5 (73).
Instances For
Equations
- Phenomena.Numerals.Snyder2026.instDecidableEqPolymorphicAnalysis 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
The lexical type of [[two]] under each analysis.
Equations
- Phenomena.Numerals.Snyder2026.PolymorphicAnalysis.substantivalism.lexicalType = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.PolymorphicAnalysis.adjectivalism.lexicalType = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.PolymorphicAnalysis.contextualism.lexicalType = Phenomena.Numerals.Snyder2026.SemTy.et
Instances For
§1, §5: nine semantic functions #
The nine semantic functions @cite{snyder-2026} attests for two.
Cases (1a-f) are §1 consensus polysemy data; (76g-j) are the additional
uses §5 argues only Polymorphic Contextualism handles.
- predicative : SemanticFunction
(1a) Mars's moons are two (in number).
- attributive : SemanticFunction
(1b) Those are (Mars's) two moons.
- quantificational : SemanticFunction
(1c) Mars has two moons.
- specificational : SemanticFunction
(1d) The number of Mars's moons is two.
- numeral : SemanticFunction
(1e) Two is an even number.
- closeAppositive : SemanticFunction
(1f) The number two is even.
- tokenRef : SemanticFunction
(76g,h) Two is next to a five on the board. — token reference.
- kindRef : SemanticFunction
(76i) Two comes in several varieties. — kind reference.
- taxonomic : SemanticFunction
(76j) Each (kind of) two belongs to a different number system.
Instances For
Equations
- Phenomena.Numerals.Snyder2026.instDecidableEqSemanticFunction 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
The target semantic type of each function. All target e except those
that are predicate- or GQ-typed at surface.
Equations
- Phenomena.Numerals.Snyder2026.SemanticFunction.predicative.targetType = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.SemanticFunction.attributive.targetType = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.SemanticFunction.quantificational.targetType = Phenomena.Numerals.Snyder2026.SemTy.ett
- Phenomena.Numerals.Snyder2026.SemanticFunction.specificational.targetType = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.SemanticFunction.numeral.targetType = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.SemanticFunction.closeAppositive.targetType = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.SemanticFunction.tokenRef.targetType = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.SemanticFunction.kindRef.targetType = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.SemanticFunction.taxonomic.targetType = Phenomena.Numerals.Snyder2026.SemTy.e
Instances For
§5: Partee/Snyder operators with type signatures #
Each operator has a deterministic input/output type, recorded as input/
output projections. PM is treated as monadic — the second predicate is
supplied externally.
Type-shifting operators entering Snyder's diagrams. RSE is not
included as a typed shifter: per @cite{rothstein-2017} and the
discussion in @cite{snyder-2026} §2, RSE is a meta-level identification
n = ∩[λx. μ#(x) = n], not a Partee-style type-shifter. The
adjectivalist numeral derivation uses NOM and then RSE-identifies
the resulting entity with a number; this is documented in
adjectivalistPath rather than recorded as an operator.
- card : Operator
@cite{snyder-2026} (6a):
CARD = λn.λx. μ#(x) = n— a number entity to a cardinality predicate. - pm : Operator
@cite{heim-kratzer-1998} (7a): Predicate Modification (monadic).
- a : Operator
@cite{partee-1987} (8a): existential closure
λP.λQ.∃x.P(x)∧Q(x). - nom : Operator
- iota : Operator
@cite{partee-1987} (74a): Russellian iota
λP.ιx[P(x)]. - ident : Operator
@cite{partee-1987} (17a): identity-predicate former
λx.λy. y = x.
Instances For
Equations
- Phenomena.Numerals.Snyder2026.instDecidableEqOperator x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
Input semantic type of each operator.
Equations
- Phenomena.Numerals.Snyder2026.Operator.card.input = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.Operator.pm.input = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.Operator.a.input = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.Operator.nom.input = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.Operator.iota.input = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.Operator.ident.input = Phenomena.Numerals.Snyder2026.SemTy.e
Instances For
Output semantic type of each operator.
Equations
- Phenomena.Numerals.Snyder2026.Operator.card.output = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.Operator.pm.output = Phenomena.Numerals.Snyder2026.SemTy.et
- Phenomena.Numerals.Snyder2026.Operator.a.output = Phenomena.Numerals.Snyder2026.SemTy.ett
- Phenomena.Numerals.Snyder2026.Operator.nom.output = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.Operator.iota.output = Phenomena.Numerals.Snyder2026.SemTy.e
- Phenomena.Numerals.Snyder2026.Operator.ident.output = Phenomena.Numerals.Snyder2026.SemTy.et
Instances For
A derivation chain is well-typed iff each operator's input matches the
previous output. Returns the final type if the chain composes, else
none.
Equations
- Phenomena.Numerals.Snyder2026.wellTyped x✝ [] = some x✝
- Phenomena.Numerals.Snyder2026.wellTyped x✝ (op :: ops) = if x✝ = op.input then Phenomena.Numerals.Snyder2026.wellTyped op.output ops else none
Instances For
§2, §5: derivation maps for the three analyses #
Substantivalism (lexical : e). Three semantic functions are not
derived (§3 — token, kind, taxonomic uses). The closeAppositive
derivation is [ident, iota]: IDENT applies first to the singular
term producing a predicate, then IOTA over the (modifier-conjoined)
predicate (Snyder (17b)+(18) p.65).
Equations
- One or more equations did not get rendered due to their size.
- Phenomena.Numerals.Snyder2026.substantivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.numeral = some []
- Phenomena.Numerals.Snyder2026.substantivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.predicative = some [Phenomena.Numerals.Snyder2026.Operator.card]
- Phenomena.Numerals.Snyder2026.substantivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.tokenRef = none
- Phenomena.Numerals.Snyder2026.substantivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.kindRef = none
- Phenomena.Numerals.Snyder2026.substantivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.taxonomic = none
Instances For
Adjectivalism (lexical : et). The numeral derivation is [nom]
reaching the specificational entity, and then identified with a
number via Rothstein's Schematic Equation (RSE) — a meta-level
stipulation not a Partee shifter, so RSE does not appear in the
operator chain. The closeAppositive derivation passes through the
numeral: [nom, ident, iota]. Same three §3 gaps.
Equations
- One or more equations did not get rendered due to their size.
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.predicative = some []
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.attributive = some [Phenomena.Numerals.Snyder2026.Operator.pm]
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.quantificational = some [Phenomena.Numerals.Snyder2026.Operator.a]
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.specificational = some [Phenomena.Numerals.Snyder2026.Operator.nom]
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.numeral = some [Phenomena.Numerals.Snyder2026.Operator.nom]
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.tokenRef = none
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.kindRef = none
- Phenomena.Numerals.Snyder2026.adjectivalistPath Phenomena.Numerals.Snyder2026.SemanticFunction.taxonomic = none
Instances For
Polymorphic Contextualism (lexical : et). All nine functions are
derivable. The closeAppositive derivation is [pm, iota]: under
contextualism both two and the modifier number are already
predicates, so PM-conjunction + IOTA suffices — no IDENT step is
needed (Snyder §5.2 (87)).
Equations
- One or more equations did not get rendered due to their size.
- Phenomena.Numerals.Snyder2026.contextualistPath Phenomena.Numerals.Snyder2026.SemanticFunction.numeral = some [Phenomena.Numerals.Snyder2026.Operator.iota]
- Phenomena.Numerals.Snyder2026.contextualistPath Phenomena.Numerals.Snyder2026.SemanticFunction.kindRef = some [Phenomena.Numerals.Snyder2026.Operator.iota]
- Phenomena.Numerals.Snyder2026.contextualistPath Phenomena.Numerals.Snyder2026.SemanticFunction.tokenRef = some [Phenomena.Numerals.Snyder2026.Operator.iota]
- Phenomena.Numerals.Snyder2026.contextualistPath Phenomena.Numerals.Snyder2026.SemanticFunction.taxonomic = some [Phenomena.Numerals.Snyder2026.Operator.iota]
Instances For
The derivation map associated with a polymorphic analysis.
Equations
- Phenomena.Numerals.Snyder2026.PolymorphicAnalysis.substantivalism.path = Phenomena.Numerals.Snyder2026.substantivalistPath
- Phenomena.Numerals.Snyder2026.PolymorphicAnalysis.adjectivalism.path = Phenomena.Numerals.Snyder2026.adjectivalistPath
- Phenomena.Numerals.Snyder2026.PolymorphicAnalysis.contextualism.path = Phenomena.Numerals.Snyder2026.contextualistPath
Instances For
A function is covered by an analysis iff the analysis derives it.
Instances For
Equations
- Phenomena.Numerals.Snyder2026.instDecidableCovers a sf = id inferInstance
Type-soundness of the derivation paths #
The substantive content of @cite{snyder-2026}'s diagrams: every prescribed derivation actually composes — input/output types align at each step, and the chain ends at the targeted type. This is the type-driven witness that the analyses are not just label collections but real compositional analyses.
Every derivation path in every analysis is well-typed and lands at the
correct target type. This is not cases <;> rfl over a stipulated
table: each case computes the wellTyped chain through Operator.input/
Operator.output and verifies the chain reaches targetType. The
none cases are vacuously true.
Coverage theorems #
Polymorphic Contextualism covers every semantic function.
Substantivalism does not cover taxonomic, kind, or token uses (Snyder §3 — the empirical gap motivating Polymorphic Contextualism).
Adjectivalism inherits the same gap.
Contextualism strictly extends Substantivalism's coverage.
Contextualism strictly extends Adjectivalism's coverage.
§4.3, §5: numbers as kinds — the TWO taxonomy #
Snyder §4.3 (51) argues NUMBER has subkinds ℕ ⊂ ℤ ⊂ ℚ ⊂ ℝ ⊂ ..., and
correspondingly the kind TWO has subkinds 2_ℕ, 2_ℤ, 2_ℚ, 2_ℝ. The
formation mechanism is @cite{mendia-2020}'s: partition by the salient
equivalence relation belongs to the same number system. Each subkind
is itself a kind — instantiated by numeral tokens representing that
specific number (Snyder §4 Tokens-Types-Kinds ontology, §4.3).
Mathematical number systems Snyder uses to illustrate subkind formation for TWO (§4.3).
- nat : MathSystem
- int : MathSystem
- rat : MathSystem
- real : MathSystem
Instances For
Equations
- Phenomena.Numerals.Snyder2026.instDecidableEqMathSystem x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
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.
A token of two: a concrete instantiation typed by its number system
(the partition criterion) plus an index distinguishing multiple tokens
of the same system (e.g., different concrete numerals on the board).
Per @cite{snyder-2026} §4 Tokens-Types-Kinds.
- system : MathSystem
Which mathematical number system this token instantiates.
- idx : ℕ
Distinguishing index for multiple tokens of the same system.
Instances For
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.
Instances For
The Mendia kind-formation for TWO: numeral tokens partitioned by their
number system. The equivalence class of a token is the subkind 2_s
for that system; distinct subkinds are disjoint by Mendia's framework
(= Carlson's Disjointness Condition).
Equations
- Phenomena.Numerals.Snyder2026.kfTWO = { r := fun (t₁ t₂ : Phenomena.Numerals.Snyder2026.TwoToken) => t₁.system = t₂.system, iseqv := Phenomena.Numerals.Snyder2026.kfTWO._proof_1 }
Instances For
The lexical extension of two under Polymorphic Contextualism: the
set of all tokens classified as a two of some number system. The
extension's full content depends on context (per @cite{rothstein-2017}
relativized atomicity); we use the unrestricted set as a witness for
the Identification-Problem theorem below.
Equations
- Phenomena.Numerals.Snyder2026.two = Set.univ
Instances For
A canonical witness token in each number system, used as the unique candidate in the Sharvy-iota proofs.
Equations
- Phenomena.Numerals.Snyder2026.canonicalTwo s = { system := s, idx := 0 }
Instances For
A four-token domain with one canonical witness per number system. The identification-problem proof works over this domain; the extension to richer domains follows the same pattern.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Sharvy iota at the Set level #
Snyder (16b) is [[the N₁ N₂]] = ιx[N₁(x) ∧ N₂(x)] — Sharvy's iota
operator picks out the unique satisfier when one exists, undefined
otherwise. We model it as a partial Option-valued operator over a
finite domain, paralleling Composition.TypeShifting.iota but operating
on Set directly (avoiding the Frame boilerplate).
Sharvy 1980's iota: the unique element of domain satisfying P,
if one exists. Returns none if no satisfier (existence presupposition
failure) or multiple satisfiers (uniqueness presupposition failure).
Equations
- Phenomena.Numerals.Snyder2026.sharvyIota domain P = match List.filter P domain with | [j] => some j | x => none
Instances For
Predicate Modification at the Set level: pointwise conjunction. Mirrors
Composition.TypeShifting.PM.
Equations
- Phenomena.Numerals.Snyder2026.setPM P Q x = (P x && Q x)
Instances For
@cite{snyder-2026} (16b) close-appositive denotation:
[[the N₁ N₂]] = ιx[N₁(x) ∧ N₂(x)] (@cite{sharvy-1980}). Real Sharvy
iota over the PM-conjunction of the two predicates; uniqueness-
presupposition failure yields none.
Equations
- Phenomena.Numerals.Snyder2026.closeAppositive domain n1 n2 = Phenomena.Numerals.Snyder2026.sharvyIota domain (Phenomena.Numerals.Snyder2026.setPM n1 n2)
Instances For
The defining computation of sharvyIota: it returns some j exactly
when filtering domain by P leaves the singleton [j].
If close appositives over disjoint modifier predicates each return
some value, the values are distinct. The substantive content of
Snyder §5.2's resolution: the iota succeeds for both descriptions
and the disjointness of the modifier-restricted subkinds forces
different referents.
§5.2: the Identification Problem dissolved #
@cite{benacerraf-1965} + Snyder §3.1, §5.2: the rigid-designator reading
of two predicts that the von Neumann ordinal two = the Zermelo ordinal two, which is incoherent given the von Neumann ordinal {∅, {∅}} has
two members and the Zermelo ordinal {{∅}} has one. Polymorphic
Contextualism dissolves the paradox: each close appositive picks out a
subkind of TWO, and the modifiers select disjoint Mendia subkinds.
Below: a fully-computed witness on canonicalDomain. The system-restriction
predicate for each number system, when intersected with the lexical
extension two, picks out exactly the canonical witness for that system;
distinct systems yield distinct witnesses; therefore the close appositives
are not coreferential.
Decidable membership in a kfTWO subkind, for use in sharvyIota.
Equations
- Phenomena.Numerals.Snyder2026.inSubkind s t = decide (t.system = s)
Instances For
Decidable membership in two (the universal predicate).
Equations
- Phenomena.Numerals.Snyder2026.inTwo x✝ = true
Instances For
For each number system s, the close appositive the [s]-system two
over the canonical 4-token domain returns precisely the canonical
witness of system s.
@cite{benacerraf-1965}'s Identification Problem (Snyder §3.1, §5.2; cf. @cite{snyder-2025}) resolved by derivation from the @cite{mendia-2020} kind-formation substrate plus @cite{sharvy-1980} iota.
For any two distinct number systems s₁ ≠ s₂, the close appositives
the [s₁]-system two and the [s₂]-system two:
- both succeed (uniqueness presupposition satisfied at the canonical domain), and
- pick out distinct canonical witness tokens.
The proof uses both substrate moves non-vacuously:
disjointness_condition kfTWO(subkinds are disjoint), thencloseAppositive_ne_of_disjoint(Sharvy iota over disjoint conjunctions yields distinct referents).
Distinct subkinds of TWO are unequal as sets — the Mendia-substrate corollary that close-appositive descriptions (which restrict the lexical extension) cannot pick out a single rigid referent across contexts. Cf. @cite{snyder-2026} §5.1 discussion of (83).
§1, §3.1, §3.4: empirical examples #
An example sentence with its semantic-function classification and acceptability judgment.
- exNum : String
- sentence : String
- function : SemanticFunction
- acceptable : Bool
Instances For
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.
Instances For
The six examples from @cite{snyder-2026} (1a-f).
Equations
- One or more equations did not get rendered due to their size.
Instances For
The three additional examples from @cite{snyder-2026} (76g,i,j) that motivate Polymorphic Contextualism.
Equations
- One or more equations did not get rendered due to their size.
Instances For
All nine attested semantic functions.
Equations
Instances For
Each SemanticFunction constructor is exhibited at least once.
@cite{snyder-2026} (20a,b): Identification-Problem judgments.
- exNum : String
- sentence : String
- truthValue : Bool
Instances For
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.
Instances For
(20a) "The von Neumann ordinal two is two-membered." TRUE.
Equations
- Phenomena.Numerals.Snyder2026.IdentificationDatum.ex20a = { exNum := "20a", sentence := "The von Neumann ordinal two is two-membered", truthValue := true }
Instances For
(20b) "The Zermelo ordinal two is two-membered." FALSE.
Equations
- Phenomena.Numerals.Snyder2026.IdentificationDatum.ex20b = { exNum := "20b", sentence := "The Zermelo ordinal two is two-membered", truthValue := false }
Instances For
The two judgments are jointly coherent — only Polymorphic Contextualism predicts both straightforwardly evaluable, by the Identification-Problem resolution above (cf. @cite{moltmann-2013}, @cite{rieppel-2021}).
Cross-framework hooks #
@cite{spector-2013} formalises a four-way taxonomy of bare-numeral analyses
(Approach = neoGricean | underspecification | exactlyOnly | ambiguityEXH)
along the lower-bound vs exact axis. Snyder's PolymorphicAnalysis carves
the orthogonal lexical-type axis. The two are intended to be independent:
one can hold any (lexical-type, lower-bound-vs-exact) combination, e.g.
contextualism × exactlyOnly or adjectivalism × neoGricean. The
orthogonality is witnessed here by the fact that no theorem connects the
two enums — they are simply parallel classifications of different choices
in a numeral semantics. Below, the formal axes-product type makes the
combinatorial space explicit.
An integrated analysis = a choice on Snyder's lexical-type axis ×
a choice on Spector's lower-bound vs exact axis. Each cell of the
PolymorphicAnalysis × Spector2013.Approach product is, in principle,
a coherent combination — the literature does not require the choices
to be linked.
- lexicalAxis : PolymorphicAnalysis
- scalarAxis : Spector2013.Approach
Instances For
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.
Instances For
The two axes are orthogonal: there are 3 × 4 = 12 combinations, every
(lexicalAxis, scalarAxis) pair is realisable as a distinct
integrated analysis.
@cite{kennedy-2015}'s "de-Fregean" type-shift is structurally
λn.λx. μ#(x) = n — exactly Snyder's CARD (6a). Adjectivalism's lexical
denotation λx. μ#(x) = 2 agrees extensionally with the partial application
of Kennedy's de-Fregean shift to the constant 2; the two analyses converge
on the cardinality predicate, differing only in whether it is the lexical
entry (Snyder Adjectivalism) or a derived form (Kennedy de-Fregean). This
agreement is documented here; making it a rfl theorem would require
co-locating the Lean denotations of CARD and Kennedy's shift in a shared
type, currently blocked by the Frame-vs-Set boundary in TypeShifting.
§6-§7: Polymorphic Contextualism for colour terms #
@cite{snyder-2026} §6-§7 conjectures that colour words admit the same Polymorphic-Contextualism analysis as numerals. The lexical entry (97):
[[red]] = λxα. red(x)
is a context-sensitive atomic predicate (parallel to [[two]] = λxα. two(x)
in §5 (73)). The kind RED has subkinds CRIMSON, MAROON, ... (cf. paint-
swatch examples (94a-c)), so colour names like red and close appositives
like the color red can refer to subkinds, the kind RED itself, or
concrete colour tokens — exactly the polymorphism (76e/g/i/j/f) the
numeral analysis predicts.
§6 cites @cite{mcnally-2011} and @cite{mcnally-deswart-2011} for the
colours-as-kinds claim. This file implements Snyder's own Polymorphic
Contextualism extension; for the @cite{mcnally-deswart-2011} competing
analysis (lexical category-projected, Chierchia ∩-via-het nominalisation),
see Phenomena/Morphology/Studies/McNallyDeSwart2011.lean. Both analyses
consume the same Mendia substrate (subkindOf on a Setoid partition by
adjective root); they disagree on lexical-projection architecture and on
whether nominalisation is Partee NOM (Snyder) or Chierchia ∩ (M&deS).
The substrate generalises across domains: this is the third consumer of
Subkinds.subkindOf, after Snyder numerals (above) and McNally-deSwart
colours/tastes. The kf{Carrier} naming convention (kfTWO, kfRed,
kfShade) is project-wide.
A colour token: a colour-domain Dutch adjective entry from
Fragments/Dutch/Adjectives.lean plus a distinguishing index for
multiple shade-tokens of the same colour. Parallel to TwoToken
above; the Mendia partition is exercised non-trivially when a single
colour root has multiple tokens (e.g., several physical instances
of rood on a paint swatch per @cite{snyder-2026} (94)).
The Dutch colour-adjective entry (
Fragments.Dutch.Adjectives.rood,wit,groen, ...). The colour-domain restriction is documentary; the type itself isAdjEntry.- idx : ℕ
Distinguishing index for multiple tokens of the same colour root.
Instances For
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.
Instances For
The Mendia kind-formation for colours: tokens partitioned by their
adjective-entry root. The equivalence class of any token is the
subkind of RED (or BLUE, or GREEN, ...) that token instantiates.
Parallel to kfTWO, attesting that Mendia's framework generalises
across domains. Carlson's Disjointness Condition follows.
Equations
- Phenomena.Numerals.Snyder2026.kfRed = { r := fun (t₁ t₂ : Phenomena.Numerals.Snyder2026.ColorToken) => t₁.root = t₂.root, iseqv := Phenomena.Numerals.Snyder2026.kfRed._proof_1 }
Instances For
@cite{snyder-2026} (97): [[red]] = λxα. red(x). The lexical extension
of red under Polymorphic Contextualism — the universal predicate
over relativized atoms, indicating that red may apply to subkinds
(CRIMSON, MAROON), to the kind RED itself, or to concrete tokens.
Parallel to two : Set TwoToken := Set.univ above.
Equations
- Phenomena.Numerals.Snyder2026.red = Set.univ
Instances For
A canonical witness colour token for each colour-adjective root.
Equations
- Phenomena.Numerals.Snyder2026.canonicalColor a = { root := a, idx := 0 }
Instances For
A canonical 6-token domain with one witness per Dutch alternating colour root (per @cite{mcnally-deswart-2011} §1, the inflection- alternating colour sub-paradigm).
Equations
- One or more equations did not get rendered due to their size.
Instances For
§6 colour-Polymorphic-Contextualism theorems #
Mirroring the numeral case, distinct colour-kinds are disjoint as
Mendia subkinds, so close-appositive descriptions like the color red
and the color green denote distinct subkinds — supporting Snyder's
claim that colour names refer polymorphically to subkinds.
Distinct colour roots project to distinct Mendia subkinds — the
colour analog of subkinds_distinct for numerals.
Indicator predicate: token t belongs to the colour-a subkind.
Equations
- Phenomena.Numerals.Snyder2026.inColorSubkind a t = decide (t.root = a)
Instances For
The colour close-appositive the color [a] over the canonical 6-token
domain returns precisely the canonical witness of colour root a,
when a is in the canonical-colour-list.
Colour analog of identification_problem_resolved: distinct colour
close appositives the color [a₁] and the color [a₂] denote
distinct canonical witness tokens, supporting the polymorphic-kind
analysis of @cite{snyder-2026} §6 (94)-(98).
§6 empirical examples (94)-(98) #
@cite{snyder-2026} §6 colour-polysemy examples (94)-(98). Each is
classified by the same SemanticFunction enum as the numeral cases,
confirming the polymorphism extends to colours.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The colour-polysemy examples exhibit three of the §1 numeral-polysemy
semantic functions (taxonomic, kindRef, tokenRef) — exactly the three
that Substantivalism and Adjectivalism fail to derive (per
substantivalism_misses_taxonomic_kind_token and friends). The
colour port confirms Snyder's §6 claim that Polymorphic Contextualism
handles them uniformly.