Bridge to Canonical GQ Denotations #
The 4-element World type used in the entailment domain doubles as an
entity domain. We create a Model + Fintype instance so that the
canonical GQ denotations from Semantics.Lexical.Determiner.Quantifier
(every_sem, some_sem, no_sem) can be instantiated here.
This bridges the entailment-testing infrastructure (finite, decidable) with the model-theoretic GQ definitions (proved conservative and monotone for arbitrary finite models).
Relation to general monotonicity theorems. The native_decide proofs
below verify monotonicity over the 4-element World model. The general
theorems — every_scope_up, no_scope_down, every_restrictor_down,
some_scope_up — are proved for arbitrary Fintype in
Quantifier.lean and Core.Logic.Quantification. The results here are
consistent instances of those general proofs.
The entailment World type, viewed as a Model entity domain.
Equations
- Semantics.Entailment.Monotonicity.entailmentModel = { Entity := Semantics.Entailment.World, decEq := inferInstance }
Instances For
Equations
- One or more equations did not get rendered due to their size.
"Every A is B" — delegates to canonical every_sem.
Equations
Instances For
"Some A is B" — delegates to canonical some_sem.
Equations
Instances For
"No A is B" — delegates to canonical no_sem.
Equations
Instances For
"Every student" as a function of scope.
Equations
Instances For
"Some student" as a function of scope.
Equations
Instances For
"No student" as a function of scope.
Equations
Instances For
"Every" is UE in scope.
"Some" is UE in scope.
"No" is DE in scope.
Fixed scope for testing restrictor monotonicity.
Instances For
"Every ___ smokes" as a function of restrictor.
Equations
Instances For
"Every" is DE in restrictor.