In §21 of Grundgesetze der Arithmetik asks us to consider the forms: a a2 = 4 and a a > 0 and notices that they can be obtained from a φ(a) by replacing the function-name placeholder φ(ξ) by names for the functions ξ2 = 4 and ξ > 0 (and the placeholder cannot be replaced by names of objects or of functions of 2 arguments).

The Generalized Quantifiers Theory, I will argue, in the second half of last Century has led to an important rapprochement, relevant both in logic and in linguistics, between logical quantification theories and the semantic analysis of quantification in natural languages. In this paper I concisely illustrate the formal aspects and the theoretical implications of this rapprochement.

We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the definition of monotonicity preserving and monotonicity reversing functions in terms of ≤. Next, we present a new algorithm for polarity marking, and implement this for a particular fragment of syntax. Finally, we list the reseach agenda that these definitions and this algorithm suggest. The implementations use Haskell [8], and are (...) given in ‘literate programming’ style [9]. (shrink)