Docs / Logic / PIP / Syntax

Syntax of PIP

import Linglib.Logic.PIP.Syntax · namespace PIP

This file defines the terms and formulas of PIP, a plural intensional presuppositional predicate calculus. Its base is first-order predicate calculus with set abstraction, equality, the set-theoretic relations ⊆, ∈, ∩, ∅ and the cardinality predicates SG and PL. PIP adds bracketed local variables [x], summation Σxφ, formula labels X ≡ φ with their uses X, and presuppositions φ|ψ. Truth is defined in Semantics.lean and felicity in Felicity.lean.

Main definitions

Main statements

Implementation notes

Relation symbols are indexed by the number of their non-world arguments and take a world as a distinguished argument, where Abney and Keshet make the first argument of a predicate a world by an assumption on models. The set-theoretic vocabulary, which ZF defines, is primitive here, its relations one signature whose meaning is fixed.

A formula is expanded before the rest of its syntax is read. Expr.locals and Expr.elim give a label no local variables and leave it in place, where Abney and Keshet read a label through a label assignment and leave the translation of an undefined label undefined. Substitution makes no check for capture, which their β-reduction excludes.

References

Declarations

PIP expressions. The terms are external variables, bracketed local variables [x], set abstraction ⋃{x : φ}, summation Σxφ, intersection and the empty plurality. The formulas are the constant ⊤, predication P_w(τ₁, …, τₙ), the logical relations, negation, conjunction, selective existential quantification, label definition X ≡ φ and label use X. An expression of either kind may carry a presupposition, e|ψ. The world w of a predication is a separate argument, where Abney & Keshet 2025 (p. 11) makes the first argument of a predicate a world by an assumption on models.

inductive ExprL81–104
(V : Type u) (L : Type v) (P : ℕ → Type w) :
Kind → Type (max u v w)

Built from ,

Used by Term, Formula, Expr.isVar, Expr.isConjunctive, Expr.vars, Expr.locals, Expr.subst, Expr.PresupFree, Expr.decidablePresupFree, Expr.labels, Expr.defs, Expr.substLabels, Expr.labels_substLabels, Expr.labels_subset_of_mem_defs, Expr.elim

Used in Logic/PIP/Felicity, Logic/PIP/Semantics

Formulas.

@[reducible, inline] abbrev FormulaL109–110
(V : Type u) (L : Type v) (P : ℕ → Type w) :
Type (max u v w)

Built from

Used by Expr.eq, Expr.subset, Expr.mem, Expr.sg, Expr.pl, Formula.disj, Formula.impl, Formula.iff, Formula.all, Formula.some, Term.sgPronoun, Expr.defs, Expr.substLabels, Expr.labels_substLabels, Expr.labels_subset_of_mem_defs, DependsOn, Formula.expand, Formula.expandSelf, Formula.lookup_eq_none_of_mem_labels_expand, Formula.HasDiscourseTranslation, Formula.HasDiscourseTranslation.labels_expandSelf, Formula.closeList

Used in Logic/PIP/Felicity, Logic/PIP/Intensional, Logic/PIP/Semantics, AbneyKeshet2025, KeshetAbney2024

L157–164

Variables and substitution

The variables occurring in an expression, bracketed or not, bound or free.

def Expr.varsL168–184
{V : Type u} {L : Type v} {P : ℕ → Type w} {k : Kind} :
Expr V L P k → Set V
Equations

Built from ,

Used in Logic/PIP/Felicity, Logic/PIP/Semantics, KeshetAbney2024

The bracketed variables occurring free in an expression ((25)–(26) of Abney & Keshet 2025), where set abstraction and quantification over x bind [x] and summation binds all of them. A label use has none, where the paper's (25d) takes the local variables of the label's definition.

def Expr.localsL190–208
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq V] {k : Kind} :
Expr V L P k → List V
Equations

Built from ,

Used by Expr.elim

Used in Logic/PIP/Felicity, Logic/PIP/Intensional, Logic/PIP/Semantics, AbneyKeshet2025, KeshetAbney2024

Substitute t for the variable x, as in the β-reduction of λx. A bracketed occurrence [x] becomes the bracketed substitute and binders of x are skipped. No capture check is made, where the β-reduction of Abney & Keshet 2025 (§2.4.6) is defined only if no free variable of t is captured.

def Expr.substL215–234
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq V] (x : V) (t : Term V L P) {k : Kind} :
Expr V L P k → Expr V L P k
Equations

Built from , , ,

Used in AbneyKeshet2025

Expressions without presuppositions

An expression with no presupposition operator and no label use.

def Expr.PresupFreeL240–256
{V : Type u} {L : Type v} {P : ℕ → Type w} {k : Kind} :
Expr V L P k → Prop
Equations

Built from ,

Used by Expr.decidablePresupFree

Used in Logic/PIP/Felicity

L258–268

Labels

The labels used in an expression, inside label definitions or not.

def Expr.labelsL272–288
{V : Type u} {L : Type v} {P : ℕ → Type w} {k : Kind} :
Expr V L P k → Set L
Equations

Built from ,

Used by Expr.labels_substLabels, Expr.labels_subset_of_mem_defs, DependsOn, Formula.lookup_eq_none_of_mem_labels_expand, Formula.HasDiscourseTranslation, Formula.HasDiscourseTranslation.labels_expandSelf

The label definitions occurring in an expression, the 𝒜φ of (29) of Abney & Keshet 2025.

def Expr.defsL290–306
{V : Type u} {L : Type v} {P : ℕ → Type w} {k : Kind} :
Expr V L P k → List (L × Formula V L P)
Equations

Built from , ,

Used by Expr.labels_subset_of_mem_defs, Formula.expandSelf, Formula.HasDiscourseTranslation

Replace every label use by its definition under the label assignment A, leaving undefined labels in place.

def Expr.substLabelsL308–325
{V : Type u} {L : Type v} {P : ℕ → Type w} (A : L → Option (Formula V L P)) {k : Kind} :
Expr V L P k → Expr V L P k
Equations

Built from , ,

Used by Expr.labels_substLabels, Formula.expand

L327–335
L337–357

The definition of X in the list of definitions A uses the label Y. A cycle of this relation is a circular definition, which makes a discourse infelicitous ((31a) of Abney & Keshet 2025).

def DependsOnL370–374
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq L] (A : List (L × Formula V L P)) (X Y : L) :

Built from ,

Used by Formula.lookup_eq_none_of_mem_labels_expand, Formula.HasDiscourseTranslation

Expand a formula by a list of label definitions: as many rounds of simultaneous substitution of each label's first definition as there are definitions.

def Formula.expandL376–379
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq L] (A : List (L × Formula V L P)) (φ : Formula V L P) :
Formula V L P

Built from ,

Used by Formula.expandSelf, Formula.lookup_eq_none_of_mem_labels_expand

Used in AbneyKeshet2025

Expansion resolves every chain of definitions that is not circular, whatever the order of the definitions: when no label depends on itself, every label left by Formula.expand is undefined.

theorem Formula.lookup_eq_none_of_mem_labels_expandL408–429
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq L] {A : List (L × Formula V L P)} (hA : ∀ (X : L), ¬Relation.TransGen (DependsOn A) X X) {φ : Formula V L P} {Y : L} (hY : Y ∈ Expr.labels (expand A φ)) :
List.lookup Y A = none

Built from , , ,

A discourse has a translation ((30)–(31a) of Abney & Keshet 2025): no label has two definitions, no definition is circular, and every label the discourse uses is defined. This is how the paper states (31a) (p. 14); by (30) alone, a circular definition that is never used would not block the translation.

structure Formula.HasDiscourseTranslationL444–454
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq L] (φ : Formula V L P) :
  • functional (X : L) (ψ ψ' : Formula V L P) : (X, ψ) ∈ Expr.defs φ → (X, ψ') ∈ Expr.defs φ → ψ = ψ'

    No label has two definitions.

  • not_circular (X : L) : ¬Relation.TransGen (DependsOn (Expr.defs φ)) X X

    No definition is circular.

  • defined (X : L) : X ∈ Expr.labels φ → List.lookup X (Expr.defs φ) ≠ none

    Every label used is defined.

Built from , , ,

Used by Formula.HasDiscourseTranslation.labels_expandSelf

Eliminability

The translation into predicate calculus with set abstraction ((27)–(28) of Abney & Keshet 2025). It drops brackets and presuppositions and replaces label definitions by ⊤; a summation Σxφ becomes the set abstraction over x of φ with its other local variables existentially closed. A label use is left in place, where the paper's (27d) translates the label's definition.

def Expr.elimL475–495
{V : Type u} {L : Type v} {P : ℕ → Type w} [DecidableEq V] {k : Kind} :
Expr V L P k → Expr V L P k
Equations

Built from , , ,

Used in Logic/PIP/Semantics