Counting Objects

We survey results on axiomatic completeness and complexity of formal languages for reasoning about finite quantities. These languages are interpreted on domains with and without structure. Expressions dealt with include 'at least n Xs are Ks,' in the case of unstructured domains, and 'at leait n 'related' Xi are Y%,' in the structured case. The results contained in this paper are brought together from generalized quantifier theory, modal logic, and knowledge representation, while a few new results are also included. A unifying approach is offered to the wide variety of formalisms available in the literature.

[1]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..

[2]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[3]  Wiebe van der Hoek.  On the Semantics of Graded Modalities , 1992, J. Appl. Non Class. Logics.

[4]  Holger Schlingloff.  Expressive completeness of temporal logic of trees , 1992, J. Appl. Non Class. Logics.

[5]  Maarten de Rijke.  Meeting some neighbours , 1992 .

[6]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[7]  Johan van Benthem,et al.  Towards a Computational Semantics , 1987 .

[8]  Dag Westerståhl.  Aristotelian syllogisms and generalized quantifiers , 1989, Stud Logica.

[9]  Catriel Beeri,et al.  Data Models and Languages for Databases , 1988, ICDT.

[10]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[11]  R. Labrecque.  The Correspondence Theory , 1978 .

[12]  John-Jules Ch. Meyer,et al.  Making Some Issues of Implicit Knowledge Explicit , 1992, Int. J. Found. Comput. Sci..

[13]  Maarten de Rijke,et al.  Generalized quantifiers and modal logic , 1993, J. Log. Lang. Inf..

[14]  John-Jules Ch. Meyer,et al.  Graded Modalities in Epistemic Logic , 1992, LFCS.

[15]  R. Goldblatt.  Logics of Time and Computation , 1987 .

[16]  Dag Westerstaåhl,et al.  Quantifiers in Formal and Natural Languages , 1989 .

[17]  Joseph Y. Halpern,et al.  A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.

[18]  J. Benthem.  Essays in Logical Semantics , 1986 .

[19]  Hassan Aït-Kaci,et al.  LOGIN: A Logic Programming Language with Built-In Inheritance , 1986, J. Log. Program..

[20]  Paolo Atzeni,et al.  Set Containment Inference and Syllogisms , 1988, Theor. Comput. Sci..

[21]  Maurizio Fattorosi-Barnaba,et al.  Graded modalities. I , 1985, Stud Logica.

[22]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..