On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models

We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties – here called CE quantifiers – one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle.     

Symmetric Propositions and Logical Quantifiers

Symmetric propositions over domain and signature are characterized following Zermelo, and a correlation of such propositions with logical type- quantifiers over is described. Boolean algebras of symmetric propositions over and Σ are shown to be isomorphic to algebras of logical type- quantifiers over . This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only those invariant under domain permutations.     

Partially Interpreted Relations and Partially Interpreted Quantifiers

Logics in which a relation R is semantically incomplete in a particular universe E, i.e. the union of the extension of R with its anti-extension does not exhaust the whole universe E, have been studied quite extensively in the last years. (Cf. van Benthem (1985), Blamey (1986), and Langholm (1988), for partial predicate logic; Muskens (1996), for the applications of partial predicates to formal semantics, and Doherty (1996) for applications to modal logic.) This is not so with semantically incomplete generalized quantifiers which constitute the subject of the present paper. The only systematic study of these quantifiers from a purely logical point of view, is, to the best of my knowledge, that by van Eijck (1995). We shall take here a different approach than that of van Eijck and mention some of the abstract properties of the resulting logic. Finally we shall prove that the two approaches are interdefinable.     

Some Closure Properties of Finite Definitions

There is no known syntactic characterization of the class of finite definitions in terms of a set of basic definitions and a set of basic operators under which the class is closed. Furthermore, it is known that the basic propositional operators do not preserve finiteness. In this paper I survey these problems and explore operators that do preserve finiteness. I also show that every definition that uses only unary predicate symbols and equality is bound to be finite.     

Quality and Quantifiers

I examine three ‘anti-object’ metaphysical views: nihilism (there are no objects at all), generalism (reality is ultimately qualitative), and anti-quantificationalism (quantification over objects does not perspicuously represent the world). After setting aside nihilism, I argue that generalists should be anti-quantificationalists. Along the way, I attempt to articulate what a ‘metaphysically perspicuous’ language might even be.     

On the Closure Properties of the Class of Full G-models of a Deductive System

In this paper we consider the structure of the class FGModS of full generalized models of a deductive system S from a universal-algebraic point of view, and the structure of the set of all the full generalized models of S on a fixed algebra A from the lattice-theoretical point of view; this set is represented by the lattice FACS_s A of all algebraic closed-set systems C on A such that (A, C) ε FGModS. We relate some properties of these structures with tipically logical properties of the sentential logic S. The main algebraic properties we consider are the closure of FGModS under substructures and under reduced products, and the property that for any A the lattice FACS_s A is a complete sublattice of the lattice of all algebraic closed-set systems over A. The logical properties are the existence of a fully adequate Gentzen system for S, the Local Deduction Theorem and the Deduction Theorem for S. Some of the results are established for arbitrary deductive systems, while some are found to hold only for deductive systems in more restricted classes like the protoalgebraic or the weakly algebraizable ones. The paper ends with a section on examples and counterexamples. Dedicated to the memory of Willem Johannes Blok     

LÉVY HIERARCHY IN WEAK SET THEORIES

We investigate the interactions of formula complexity in weak set theories with the axioms available there. In particular, we show that swapping bounded and unbounded quantification preserves formula complexity in presence of the axiom of foundation weakened to an arbitrary set base, while it does not if the axiom of foundation is further weakened to a proper class base. More attention is being paid to the necessary axioms employed in the positive results, than to the combinatorial strength of the positive results themselves.     

Quantifiers and question answering in young children

Two hypotheses were tested about how young children answer questions with the quantifiers all and some: (a) that children use syntactic cues in determining which noun phrase is quantified, and (b) that children evaluate a some-statement as part of evaluating an all-statement. To test these hypotheses, the same group of 60 4- to 7-year-olds were asked four contrasting types of quantitative questions. The results indicated that children can use syntactic cues under some presentation conditions. However, there was no evidence for an asymmetry between the all-and some-questions. A model of how young children might answer quantitative questions was then considered.     

Henkin Quantifiers and the Definability of Truth

Henkin quantifiers have been introduced in Henkin (1961). Walkoe (1970) studied basic model-theoretical properties of an extension L _* ¹(H) of ordinary first-order languages in which every sentence is a first-order sentence prefixed with a Henkin quantifier. In this paper we consider a generalization of Walkoe's languages: we close L _* ¹(H) with respect to Boolean operations, and obtain the language L ¹(H). At the next level, we consider an extension L _* ²(H) of L ¹(H) in which every sentence is an L ¹(H)-sentence prefixed with a Henkin quantifier. We repeat this construction to infinity. Using the (un)-definability of truth – in – N for these languages, we show that this hierarchy does not collapse. In addition, we compare some of the present results to the ones obtained by Kripke (1975), McGee (1991), and Hintikka (1996).     

Quantifiers and propositional attitudes: Quine revisited

Quine introduced a famous distinction between the ‘notional’ sense and the ‘relational’ sense of certain attitude verbs. The distinction is both intuitive and sound but is often conflated with another distinction Quine draws between ‘dyadic’ and ‘triadic’ (or higher degree) attitudes. I argue that this conflation is largely responsible for the mistaken view that Quine’s account of attitudes is undermined by the problem of the ‘exportation’ of singular terms within attitude contexts. Quine’s system is also supposed to suffer from the problem of ‘suspended judgement with continued belief’. I argue that this criticism fails to take account of a crucial presupposition of Quine’s about the connection between thought and language. The aim of the paper is to defend the spirit of Quine’s account of attitudes by offering solutions to these two problems. See also chapters four and five of Word and Object (Quine, 1960) and ‘Intensions Revisited’ (Quine, 1977).     

Uniform Interpolation and Propositional Quantifiers in Modal Logics

We investigate uniform interpolants in propositional modal logics from the proof-theoretical point of view. Our approach is adopted from Pitts’ proof of uniform interpolationin intuitionistic propositional logic [15]. The method is based on a simulation of certain quantifiers ranging over propositional variables and uses a terminating sequent calculus for which structural rules are admissible. We shall present such a proof of the uniform interpolation theorem for normal modal logics K and T. It provides an explicit algorithm constructing the interpolants. Presented by Heinrich Wansing     

Plausible Reasoning and the Resolution of Quantifier Scope Ambiguities

Despite overwhelming evidence suggesting that quantifier scope is a phenomenon that must be treated at the pragmatic level, most computational treatments of scope ambiguities have thus far been a collection of syntactically motivated preference rules. This might be in part due to the prevailing wisdom that a commonsense inferencing strategy would require the storage of and reasoning with a vast amount of background knowledge. In this paper we hope to demonstrate that the challenge in developing a commonsense inferencing strategy is in the discovery of the relevant commonsense data and in a proper formulation of the inferencing strategy itself, and that a massive amount of background knowledge is not always required. In particular, we present a very effective procedure for resolving quantifier scope ambiguities at the pragmatic level using simple quantitative data that is readily available in most database environments.     

The unique correspondence of the item response function and item category response functions in polytomously scored item response models

The item response function (IRF) for a polytomously scored item is defined as a weighted sum of the item category response functions (ICRF, the probability of getting a particular score for a randomly sampled examinee of ability ). This paper establishes the correspondence between an IRF and a unique set of ICRFs for two of the most commonly used polytomous IRT models (the partial credit models and the graded response model). Specifically, a proof of the following assertion is provided for these models: If two items have the same IRF, then they must have the same number of categories; moreover, they must consist of the same ICRFs. As a corollary, for the Rasch dichotomous model, if two tests have the same test characteristic function (TCF), then they must have the same number of items. Moreover, for each item in one of the tests, an item in the other test with an identical IRF must exist. Theoretical as well as practical implications of these results are discussed.This research was supported by Educational Testing Service Allocation Projects No. 79409 and No. 79413. The authors wish to thank John Donoghue, Ming-Mei Wang, Rebecca Zwick, and Zhiliang Ying for their useful comments and discussions. The authors also wish to thank three anonymous reviewers for their comments.     

The generalized Logit-Linear Item Response Model for Binary-Designed Items

This paper introduces the generalized logit-linear item response model (GLLIRM), which represents the item-solving process as a series of dichotomous operations or steps. The GLLIRM assumes that the probability function of the item response is a logistic function of a linear composite of basic parameters which describe the operations, and the coefficients depend on three design matrices X, Y and Z. The GLLIRM provides a tool for testing hypotheses on the item-solving process and generalizes existing models. An empirical application is included, in which the model is applied to evaluate sources of difficulty and pairwise item interactions in a logical analysis test. This research was supported by the Comunidad de Madrid grant CCG06-UAM/ESP-0043.     

Question answering and database querying: Bridging the gap with generalized quantification

Even though Questions Answering and Database Querying have very different goals and frameworks, collaboration between the two fields could be mutually beneficial. However, the different assumptions in each field makes such collaboration difficult. In this paper, we introduce a query language with generalized quantifiers (QLGQ) and show how it could be used to help bridge the gap between the two fields.     

The relation between the generalized matching law and signal-detection theory

The generalized matching law can be applied to a signal-detection matrix to give two equations. The first relates responding in the presence of the stimulus to the reinforcements for the responses, and the second relates responding in the absence of the stimulus to the reinforcements for the responses. Evidence for stimulus discrimination is given by biases that are opposite in sign in the two equations. As the logarithmic ratio and z proportion transformations are similar, the combination of the absolute values of the two logarithmic biases gives a measure equivalent to the signal-detection measures d′ and η. The two equations can also be combined to eliminate the biases caused by the signalling stimuli and to produce a generalized matching-law statement relating overall performance to the obtained reinforcements.     

Modification indices for the 2-PL and the nominal response model

In this paper, it is shown that various violations of the 2-PL model and the nominal response model can be evaluated using the Lagrange multiplier test or the equivalent efficient score test. The tests presented here focus on violation of local stochastic independence and insufficient capture of the form of the item characteristic curves. Primarily, the tests are item-oriented diagnostic tools, but taken together, they also serve the purpose of evaluation of global model fit. A useful feature of Lagrange multiplier statistics is that they are evaluated using maximum likelihood estimates of the null-model only, that is, the parameters of alternative models need not be estimated. As numerical examples, an application to real data and some power studies are presented.