- Definition and properties
- Relation to natural languages
- See also
- References
- External links
In logic a branching quantifier,[1] also called a Henkin quantifier, finite partially ordered quantifier or even nonlinear quantifier, is a partial ordering[2]
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 ym bound by a quantifier Qm depends on the value of the variables
y1, ..., ym−1
bound by quantifiers
Qy1, ..., Qym−1
preceding Qm. 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.
Definition and properties
The simplest Henkin quantifier 
is
It (in fact every formula with a Henkin prefix, not just the simplest one) is equivalent to its second-order Skolemization, i.e.
It is also powerful enough to define the quantifier 
(i.e. "there are infinitely many") defined as
Several things follow from this, including the nonaxiomatizability of first-order logic with (first observed by Ehrenfeucht), and its equivalence to the 
-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 .[2]
- Rescher: "The number of φs is less than or equal to the number of ψs"
- Härtig: "The φs are equinumerous with the ψs"
- Chang: "The number of φs is equinumerous with the domain of the model"
The Henkin quantifier can itself be expressed as a type (4) Lindström quantifier.[2]
Relation to natural languages
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]
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 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 
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.
where
denotes
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]
See also
- Game semantics
- Dependence logic
- Independence-friendly logic (IF logic)
- Mostowski quantifier
- Lindström quantifier
- Nonfirstorderizability
References
2. ^1 2 {{cite book|author=Antonio Badia|title=Quantifiers in Action: Generalized Quantification in Query, Logical and Natural Languages|url=https://books.google.com/books?id=WC4pkt3m5b0C&pg=PA74|year=2009|publisher=Springer|isbn=978-0-387-09563-9|page=74–76}}
3. ^Henkin, L. "Some Remarks on Infinitely Long Formulas". Infinitistic Methods: Proceedings of the Symposium on Foundations of Mathematics, Warsaw, 2–9 September 1959, Panstwowe Wydawnictwo Naukowe and Pergamon Press, Warsaw, 1961, pp. 167–183. {{OCLC|2277863}}
4. ^Jaakko Hintikka and Gabriel Sandu, "Game-theoretical semantics", in Handbook of logic and language, ed. J. van Benthem and A. ter Meulen, Elsevier 2011 (2nd ed.) citing Enderton, H.B., 1970. Finite {{Sic|hide=y|partially|-}}ordered quantifiers. Z. Math. Logik Grundlag. Math. 16, 393–397 {{doi|10.1002/malq.19700160802}}.
5. ^{{Cite journal | last1 = Blass | first1 = A. | last2 = Gurevich | first2 = Y. | doi = 10.1016/0168-0072(86)90040-0 | title = Henkin quantifiers and complete problems | journal = Annals of Pure and Applied Logic | volume = 32 | pages = 1–16 | year = 1986 | pmid = | pmc = | url = http://research.microsoft.com/en-us/um/people/gurevich/Opera/66.pdf}} citing W. Walkoe, Finite {{Sic|hide=y|partially|-}}ordered quantification, Journal of Symbolic Logic 35 (1970) 535–555. {{jstor|2271440}}
6. ^{{Cite journal | last1 = Hintikka | first1 = J. | title = Quantifiers vs. Quantification Theory | doi = 10.1111/j.1746-8361.1973.tb00624.x | journal = Dialectica | volume = 27 | issue = 3–4 | pages = 329–358 | year = 1973 | pmid = | pmc = }}
7. ^1 2 3 {{Cite journal | last1 = Gierasimczuk | first1 = N. | last2 = Szymanik | first2 = J. | doi = 10.1093/jos/ffp008 | title = Branching Quantification v. Two-way Quantification | journal = Journal of Semantics | volume = 26 | issue = 4 | pages = 367 | year = 2009 | pmid = | pmc = | url = http://www.jakubszymanik.com/papers/HTR.pdf}}
8. ^{{Cite journal | last1 = Sher | first1 = G. | title = Ways of branching quantifers | doi = 10.1007/BF00630749 | journal = Linguistics and Philosophy | volume = 13 | issue = 4 | pages = 393–422 | year = 1990 | pmid = | pmc = }}
9. ^{{Cite journal | last1 = Barwise | first1 = J. | title = On branching quantifiers in English | doi = 10.1007/BF00258419 | journal = Journal of Philosophical Logic | volume = 8 | year = 1979 | pmid = | pmc = | pages = 47–80}}
10. ^{{cite journal | first1 = Michael | last1 = Hand | title = The Journal of Symbolic Logic | journal = The Journal of Symbolic Logic | volume = 63 | issue = 4 | year = 1998 | jstor = 2586678 | pages = 1611–1614 | doi = 10.2307/2586678 }}
External links
- [https://web.archive.org/web/20070930235518/http://planetmath.org/encyclopedia/Branching.html Game-theoretical quantifier] at PlanetMath.
- Alberta Highway 664
- Alberta Highway 789
- Alberta Highway 918
- Alberta Highway 92
- Alberta Highway 922
- Alberta Human Rights and Citizenship Commission
- Albert Aiken
- Alberta Jeannette Cassell
- Alberta Jones
- Alberta Jones Seaton
- Alberta Junior A Hockey League
- Albert Akroyd
- Albert, Al
- Albert Alain
- Alberta Law Enforcement Response Team
- Alberta Law Enforcement Response Teams
- Albert Albers Barn
- Albert Alexander
- Albert Alexander (disambiguation)
- Albert Alexander Gray
- Albert Alexander, Sr.
- Alberta Liberal Party candidates, 2012 Alberta provincial election
- Alberta Liberal Party leadership election, 2008
- Alberta Liberal Party leadership election, 2011
- Alberta Liberal Party leadership election, 2016