Declarations
A model: pluralities are sets of atoms α, and each n-ary relation symbol
is interpreted over a world plurality and a tuple of n pluralities.
I
{n : ℕ } :
P n → Set α → (Fin n → Set α ) → Prop The interpretation of relation symbols.
Used by Expr.Realize , Term.realize , Formula.Realize , Term.mem_realize , Term.realize_var , Term.realize_bvar , Term.realize_inter , Term.realize_empty , Term.realize_presup , Term.mem_realize_abs , Term.mem_realize_sigma , Formula.realize_top , Formula.realize_atom , Formula.realize_rel , Formula.realize_eq , Formula.realize_subset , Formula.realize_mem , Formula.realize_sg , Formula.realize_pl , Formula.realize_neg , Formula.realize_conj , Formula.realize_ex , Formula.realize_presup , Formula.realize_labelDef , Formula.realize_label , Formula.realize_disj , Formula.realize_impl , Formula.realize_iff , Formula.realize_all , Formula.realize_some , Formula.realize_ex_iff_abs_nonempty , Term.realize_sigma_eq , Term.realize_sigma_eq_of_mem_locals , Term.realize_sigma_eq_image , Term.realize_sigma_eq_of_distributive , Expr.realize_congr , Formula.realize_congr , Model.Divisive , Term.exists_realize_eq_of_isVar , Expr.realize_of_isConjunctive , Term.realize_sigma_eq_of_isConjunctive , Formula.realize_closeList , Expr.realize_elim , Term.realize_elim , Formula.realize_elim
Used in Logic/PIP/Felicity , Logic/PIP/Intensional , AbneyKeshet2025 , KeshetAbney2024
The point at which an expression of a kind is realized: an atom, whose
membership in a term's value is at stake, or nothing for a formula.
Used by Expr.Realize , Expr.realize_congr , Expr.realize_of_isConjunctive , Expr.realize_elim
The meaning of the logical relations on pluralities. Membership s ∈ t holds when s is the
singleton of an atom of t.
Used by Expr.Realize , Formula.realize_rel
Realization: membership of an atom in the value of a term, and truth of a
formula. A variable denotes its assignment, abstraction and summation the union
of the values of the bound variable over assignments agreeing outside the bound
variables; a formula is true classically, with presuppositions and label
definitions transparent and an unexpanded label false.
Equations Built from Model , Kind.Point , LogicalRel.Holds
Used by Term.realize , Formula.Realize , Term.mem_realize , Expr.realize_congr , Expr.realize_of_isConjunctive , Expr.realize_elim
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (t : Term V L P ) : Set α
Built from Model , Expr.Realize
Used by Term.mem_realize , Term.realize_var , Term.realize_bvar , Term.realize_inter , Term.realize_empty , Term.realize_presup , Term.mem_realize_abs , Term.mem_realize_sigma , Formula.realize_atom , Formula.realize_rel , Formula.realize_eq , Formula.realize_subset , Formula.realize_mem , Formula.realize_sg , Formula.realize_pl , Formula.realize_some , Formula.realize_ex_iff_abs_nonempty , Term.realize_sigma_eq , Term.realize_sigma_eq_of_mem_locals , Term.realize_sigma_eq_image , Term.realize_sigma_eq_of_distributive , Term.exists_realize_eq_of_isVar , Term.realize_sigma_eq_of_isConjunctive , Term.realize_elim
Used in Logic/PIP/Felicity , Logic/PIP/Intensional , AbneyKeshet2025 , KeshetAbney2024
Built from Model , Expr.Realize
Used by Term.mem_realize_abs , Term.mem_realize_sigma , Formula.realize_top , Formula.realize_atom , Formula.realize_rel , Formula.realize_eq , Formula.realize_subset , Formula.realize_mem , Formula.realize_sg , Formula.realize_pl , Formula.realize_neg , Formula.realize_conj , Formula.realize_ex , Formula.realize_presup , Formula.realize_labelDef , Formula.realize_label , Formula.realize_disj , Formula.realize_impl , Formula.realize_iff , Formula.realize_all , Formula.realize_some , Formula.realize_ex_iff_abs_nonempty , Term.realize_sigma_eq , Term.realize_sigma_eq_of_mem_locals , Term.realize_sigma_eq_image , Term.realize_sigma_eq_of_distributive , Formula.realize_congr , Term.realize_sigma_eq_of_isConjunctive , Formula.realize_closeList , Formula.realize_elim
Used in Logic/PIP/Felicity , Logic/PIP/Intensional , AbneyKeshet2025 , KeshetAbney2024
@[simp] theorem Term.mem_realize L118–119
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) {t : Term V L P } {a : α } :
Built from Model , Expr.Realize , Term.realize
@[simp] theorem Term.realize_var L121
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (x : V ) :
Built from Model , Term.realize
@[simp] theorem Term.realize_bvar L123
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (x : V ) :
Built from Model , Term.realize
@[simp] theorem Term.realize_inter L125–126
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (s t : Term V L P ) :
Built from Model , Term.realize
@[simp] theorem Term.realize_empty L128
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) :
Built from Model , Term.realize
@[simp] theorem Term.realize_presup L130–131
Built from Model , Term.realize
@[simp] theorem Term.mem_realize_abs L133–135
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (x : V ) (φ : Formula V L P ) (a : α ) :
Built from Model , Term.realize , Formula.Realize
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (x : V ) (φ : Formula V L P ) (a : α ) :
Built from Model , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_top L142–143
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) :
Built from Model , Formula.Realize
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) {n : ℕ } (r : P n ) (w : Term V L P ) (ts : Fin n → Term V L P ) :
Built from Model , Term.realize , Formula.Realize
Built from Model , LogicalRel.Holds , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_eq L153–154
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (s t : Term V L P ) :
Built from Model , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_subset L156–157
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (s t : Term V L P ) :
Built from Model , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_mem L159–161
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (s t : Term V L P ) :
Built from Model , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_sg L163–164
Built from Model , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_pl L166–168
Built from Model , Term.realize , Formula.Realize
@[simp] theorem Formula.realize_neg L170–171
Built from Model , Formula.Realize
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_ex L176–178
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_presup L180–181
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_labelDef L183–184
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_label L186–187
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (X : L ) :
Built from Model , Formula.Realize
Derived clauses
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_impl L195–197
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_iff L199–203
Built from Model , Formula.Realize
@[simp] theorem Formula.realize_all L205–207
Built from Model , Formula.Realize
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (s t : Term V L P ) :
Built from Model , Term.realize , Formula.Realize
∃xφ is true iff ⋃{x : φ} is nonempty, provided φ is false when x is
the null plurality, the standing assumption that predicates are false of the
null individual.
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) (x : V ) (φ : Formula V L P ) (h : ¬ Realize M (Function.update g x ∅ ) φ ) :
Built from Model , Term.realize , Formula.Realize
The value of a summation whose body, on the assignments agreeing outside the
summation variable and its locals, depends on the summation variable's value
alone: the sum of the pluralities satisfying that condition.
Built from Model , Term.realize , Formula.Realize
The value of a summation whose body depends on the summation variable's value and on
that of a local variable y: the sum of the pluralities related to some plurality, the
local being summed away.
Built from Model , Term.realize , Formula.Realize
A summation over a singular description, true of the singletons of the images of s:
the plurality of those images.
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) {β : Type u_2} {x : V } {φ : Formula V L P } {f : β → α } {s : Set β } (hφ : ∀ (g' : V → Set α ), Set.EqOn g' g { y : V | y ∉ Expr.locals φ ∧ y ≠ x } → (Formula.Realize M g' φ ↔ ∃ (b : β ), g' x = { f b } ∧ b ∈ s ) ) :
Built from Model , Term.realize , Formula.Realize
A summation over a distributive description, true of the nonempty pluralities within
s: s itself.
{V : Type u} {L : Type v} {P : ℕ → Type w } {α : Type u_1} [DecidableEq V ] (M : Model P α ) (g : V → Set α ) {x : V } {φ : Formula V L P } {s : Set α } (hφ : ∀ (g' : V → Set α ), Set.EqOn g' g { y : V | y ∉ Expr.locals φ ∧ y ≠ x } → (Formula.Realize M g' φ ↔ (g' x ) .Nonempty ∧ g' x ⊆ s ) ) :
Built from Model , Term.realize , Formula.Realize