Branching quantifier

In logic a branching quantifier,^[1] also called a Henkin quantifier, finite partially ordered quantifier or even nonlinear quantifier, is a partial ordering^[2]

${\displaystyle \langle Qx_{1}\dots Qx_{n}\rangle }$

of quantifiers for Q ∈ {∀,∃}. It is a special case of generalized quantifier. In classical logic, quantifier prefixes are linearly ordered such that the value of a variable y_m bound by a quantifier Q_m depends on the value of the variables

y₁, ..., y_m−1

bound by quantifiers

Qy₁, ..., Qy_m−1

preceding Q_m. In a logic with (finite) partially ordered quantification this is not in general the case.

Branching quantification first appeared in a 1959 conference paper of Leon Henkin.^[3] Systems of partially ordered quantification are intermediate in strength between first-order logic and second-order logic. They are being used as a basis for Hintikka's and Gabriel Sandu's independence-friendly logic.

The simplest Henkin quantifier ${\displaystyle Q_{H}}$ is

${\displaystyle (Q_{H}x_{1},x_{2},y_{1},y_{2})\varphi (x_{1},x_{2},y_{1},y_{2})\equiv {\begin{pmatrix}\forall x_{1}\,\exists y_{1}\\\forall x_{2}\,\exists y_{2}\end{pmatrix}}\varphi (x_{1},x_{2},y_{1},y_{2}).}$

It (in fact every formula with a Henkin prefix, not just the simplest one) is equivalent to its second-order Skolemization, i.e.

${\displaystyle \exists f\,\exists g\,\forall x_{1}\forall x_{2}\,\varphi (x_{1},x_{2},f(x_{1}),g(x_{2})).}$

It is also powerful enough to define the quantifier ${\displaystyle Q_{\geq \mathbb {N} }}$ (i.e. "there are infinitely many") defined as

${\displaystyle (Q_{\geq \mathbb {N} }x)\varphi (x)\equiv (\exists a)(Q_{H}x_{1},x_{2},y_{1},y_{2})[\varphi (a)\land (x_{1}=x_{2}\leftrightarrow y_{1}=y_{2})\land (\varphi (x_{1})\rightarrow (\varphi (y_{1})\land y_{1}\neq a))].}$

Several things follow from this, including the nonaxiomatizability of first-order logic with ${\displaystyle Q_{H}}$ (first observed by Ehrenfeucht), and its equivalence to the ${\displaystyle \Sigma _{1}^{1}}$-fragment of second-order logic (existential second-order logic)—the latter result published independently in 1970 by Herbert Enderton^[4] and W. Walkoe.^[5]

The following quantifiers are also definable by ${\displaystyle Q_{H}}$.^[2]

• Rescher: "The number of φs is less than or equal to the number of ψs"

${\displaystyle (Q_{L}x)(\varphi x,\psi x)\equiv \operatorname {Card} (\{x\colon \varphi x\})\leq \operatorname {Card} (\{x\colon \psi x\})\equiv (Q_{H}x_{1}x_{2}y_{1}y_{2})[(x_{1}=x_{2}\leftrightarrow y_{1}=y_{2})\land (\varphi x_{1}\rightarrow \psi y_{1})]}$

• Härtig: "The φs are equinumerous with the ψs"

${\displaystyle (Q_{I}x)(\varphi x,\psi x)\equiv (Q_{L}x)(\varphi x,\psi x)\land (Q_{L}x)(\psi x,\varphi x)}$

• Chang: "The number of φs is equinumerous with the domain of the model"

${\displaystyle (Q_{C}x)(\varphi x)\equiv (Q_{L}x)(x=x,\varphi x)}$

The Henkin quantifier ${\displaystyle Q_{H}}$ can itself be expressed as a type (4) Lindström quantifier.^[2]

Hintikka in a 1973 paper^[6] advanced the hypothesis that some sentences in natural languages are best understood in terms of branching quantifiers, for example: "some relative of each villager and some relative of each townsman hate each other" is supposed to be interpreted, according to Hintikka, as:^[7][8]

${\displaystyle {\begin{pmatrix}\forall x_{1}\,\exists y_{1}\\\forall x_{2}\,\exists y_{2}\end{pmatrix}}[(V(x_{1})\wedge T(x_{2}))\rightarrow (R(x_{1},y_{1})\wedge R(x_{2},y_{2})\wedge H(y_{1},y_{2})\wedge H(y_{2},y_{1}))].}$

which is known to have no first-order logic equivalent.^[7]

The idea of branching is not necessarily restricted to using the classical quantifiers as leaves. In a 1979 paper,^[9] Jon Barwise proposed variations of Hintikka sentences (as the above is sometimes called) in which the inner quantifiers are themselves generalized quantifiers, for example: "Most villagers and most townsmen hate each other."^[7] Observing that ${\displaystyle \Sigma _{1}^{1}}$ is not closed under negation, Barwise also proposed a practical test to determine whether natural language sentences really involve branching quantifiers, namely to test whether their natural-language negation involves universal quantification over a set variable (a ${\displaystyle \Pi _{1}^{1}}$ sentence).^[10]

Hintikka's proposal was met with skepticism by a number of logicians because some first-order sentences like the one below appear to capture well enough the natural language Hintikka sentence.

${\displaystyle [\forall x_{1}\,\exists y_{1}\,\forall x_{2}\,\exists y_{2}\,\varphi (x_{1},x_{2},y_{1},y_{2})]\wedge [\forall x_{2}\,\exists y_{2}\,\forall x_{1}\,\exists y_{1}\,\varphi (x_{1},x_{2},y_{1},y_{2})]}$

where

${\displaystyle \varphi (x_{1},x_{2},y_{1},y_{2})}$

denotes

${\displaystyle (V(x_{1})\wedge T(x_{2}))\rightarrow (R(x_{1},y_{1})\wedge R(x_{2},y_{2})\wedge H(y_{1},y_{2})\wedge H(y_{2},y_{1}))}$

Although much purely theoretical debate followed, it wasn't until 2009 that some empirical tests with students trained in logic found that they are more likely to assign models matching the "bidirectional" first-order sentence rather than branching-quantifier sentence to several natural-language constructs derived from the Hintikka sentence. For instance students were shown undirected bipartite graphs—with squares and circles as vertices—and asked to say whether sentences like "more than 3 circles and more than 3 squares are connected by lines" were correctly describing the diagrams.^[7]

• Game semantics
• Dependence logic
• Independence-friendly logic (IF logic)
• Mostowski quantifier
• Lindström quantifier
• Nonfirstorderizability

• Game-theoretical quantifier at PlanetMath.