deadline for
submissions: 17 Mars 2017

notification to authors: 15 April 2017

final version due: 19 May 2017

conference: 17-21 July 2017 see programme below

The compositional
interpretation of determiners relies on quantifiers — in a
general acceptation of this later term which includes
generalised quantifiers, generics, definite descriptions i.e.
any operation that applies to one or several formulas with a
free variable, binds it and yields a formula or possibly a
generic term (the operator is then called a subnector,
following Curry). There is a long history of quantification in
the Ancient and Medieval times at the border between logic and
philosophy of language, before the proper formalisation of
quantification by Frege.

A common solution for natural language semantics is the
so-called theory of generalised quantifiers. Quantifiers like «
some, exactly two, at most three, the majority of, most of, few,
many, … » are all described in terms of functions of two
predicates viewed as subsets.

Nevertheless, many mathematical and linguistic questions remain
open.

On the mathematical side, little is known about generalised ,
generalised and vague quantifiers, in particular about their
proof theory. On the other hand, even for standard quantifiers,
indefinites and definite descriptions, there exist alternative
formulations with choice functions and generics or subnectors
(Russell’s iota, Hilbert-Bernays, eta, epsilon, tau). The
computational aspects of these logical frameworks are also worth
studying, both for computational linguistic software and for the
modelling of the cognitive processes involved in understanding
or producing sentences involving quantifiers.

On the linguistic side, the relation between the syntactic
structure and its semantic interpretation, quantifier raising,
underspecification, scope issues,… are not fully
satisfactory. Furthermore extension of linguistic studies to
various languages have shown how complex quantification is in
natural language and its relation to phenomena like generics,
plurals, and mass nouns.

Finally, and this can be seen as a link between formal models of
quantification and natural language, there by now exist
psycholinguistic experiments that connect formal models and
their computational properties to the actual way human do
process sentences with quantifiers, and handle their inherent
ambiguity, complexity, and difficulty in understanding.

All those aspects are
connected in the didactics of mathematics and computer science:
there are specific difficulties to teach (and to learn) how
to understand, manipulate, produce and prove
quantified statements, and to determine the proper level
of formalisation between bare logical formulas and written or
spoken natural language.

This workshop aims at
gathering mathematicians, logicians,
linguists, computer scientists to present their latest
advances in the study of quantification.

Among the topics that wil be addressed are the following :

- new ideas in quantification in mathematical logic, both model theory and proof theory:
- choice functions,
- subnectors (Russell’s iota, Hilbert’s epsilon and tau),
- higher order quantification,
- quantification in type theory
- studies of the lexical, syntactic and semantic of quantification in various languages
- semantics of noun
phrases

- generic noun phrases
- semantics of plurals and mass nouns
- experimental study of quantification and generics
- computational applications of quantification and polarity especially for question-answering.
- quantification in
the didactics of mathematics and computer science.

- Anna Szabolcsi Quantification Cambridge University Press 2010
- Stanley Peters and Dag Westerstahl Quantifiers in Language and Logic Oxford Univ. Press 2010
- Mark Steedman Taking Scope - The Natural Semantics of Quantifiers MIT Press 2012
- Jakub Szymanik. Quantifiers and Cognition, Studies in Linguistics and Philosophy, Springer, 2015.
- Stergios
Chatzikyriakidis, Fabio Pasquali, Christian Retoré
(eds). Special issue on Hilbert’s ep- silon and tau in Logic,
Informatics and Linguistics, Volume 4(2) of IfCoLog Journal of
Logics and their Applications. http://www.collegepublications.co.uk/journals/
ifcolog/?00011.

This is a tentative schedule that may slightly evolve.

**MONDAY**

*WORKSHOP INTRODUCTION Quantifiers and determiners: an interdisciplinary overview (Ch. Retoré & Mark Steedman)*

- Allan
Ramsay and Ghadah Binhadba. The
constructive nature of natural language quantifiers

**TUESDAY**- Kees van
Deemter, Le Sun, Rint Sybesma. Definiteness: Towards a Global
Perspective

- Makoto Kaneko. Determiners and classifiers
- Larry Moss. Reasoning About the Sizes of Sets: What we Know, and What we Don't Know Yet
- Myriam Quatrini and Christophe Fouquere. Refinement of universel quantification in Proof Theory
**WEDNESDAY**

- Aniello De Santo, Thomas Graf and John E. Drury. Evaluating Subregular Distinctions in the Complexity of Generalized Quantifiers
- Clément Beysson, Sarah Blind, Philippe de Groote and Bruno Guillaume. Generalized quantifiers and dynamicity
- Sascha
Alexeyenko. Quantification
in event semantics: generalized quantifiers vs. sub-events

- Viviane Durand-Guerrier, Faiza Chellougui and Simon Modeste. Anaphora in mathematics and informatics education
**THURSDAY**

- Manuel
Kriz. A
Trivalent Logic for Plural Predication and Quantification
- Lucas Champollion, Justin Bledin and Haoze Li. Rigid and Flexible
Quantification in Plural Predicate Logic

- Hans Leiß. Completeness of the Indexed Epsilon-Calculus without Equality for Choice Functions
- David Lahm. Is Choice Still a Choice?
**FRIDAY**

- Carmen Dobrovie-Sorin. Partitive MOST and the two NP hypothesis
- Camilo Thorne. Distribution of Generalized Quantifiers in Large Corpora
- Riccardo Pulicani. Aspects of Italian quantification: an experimental study
*DI**SCUSSION & CONCLUSION:**scientific perspectives, possible publicatio**n, other worksh**op(s),**etc.*

- Christian Retoré (Université de Montpellier & LIRMM-CNRS)
- Mark Steedman
(University of Edinburgh)

- Vito Michele Abrusci (Università di Roma tre)
- Mathias Baaz (University of Technology, Vienna)
- Daisukke Bekki (Ochanomizu University, Tokyo)
- Oliver Bott
(Universität Tübingen)

- Francis Corblin (Université Paris Sorbonne)
- Martin Hakl (Massachusetts Institute of Technology, Cambridge MA)
- Makoto Kanazawa (National Institute of Informatics, Tokyo)
- Dan Lassiter (Stanford University)
- Zhaohui Luo (Royal Holloway College, London)
- Alda Mari (CNRS Institut Jean Nicod, Paris)
- Wilfried Meyer-Viol (King’s college, London)
- Michel Parigot (CNRS IRIF, Paris)
- Anna Szabolcsi (New-York University)
- Jakub Szymanik (Universiteit van Amsterdam)
- Dag Westerstahl (Stockholm University)
- Bruno Woltzenlogel Paleo (University of Technology, Vienna)
- Richard Zach (University of Calgary)
- Roberto Zamparelli (Università di Trento)

Abstract
should be less than four pages of contents with, in addition to
these four pages, a bibliography.

We prefer abstracts to be typeset with LaTeX, using the
following template:

- the latex template itself

- the PDF result

- it should not be
useful but you can have a look at bibliography files : the bib file for bibtex
and the bbl file

For non
latex users, the style is 12pt, times, with margin 2,5 cm,
and you for the title affiliation, sections, bibliography etc. here is a PDF example.