Normal forms for characteristic functions on n-ary relations

Journal of Logic and Computation

Volumn 15, Issue 2, 2005, Pages 85-98

  Van Eijck, Jan ^a  

^a CWI   (Netherlands)

Author keywords

Compositionality; Fregean versus non Fregean quantifiers; Polyadic quantification; Quantifier decomposition; Semantics of natural language

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DECOMPOSITION; FUNCTIONS; NATURAL LANGUAGE PROCESSING SYSTEMS; SET THEORY; THEOREM PROVING;

COMPOSITIONALITY; FREGEAN VERSUS NON-FREGEAN QUANTIFIERS; POLYADIC QUANTIFICATION; QUANTIFIER DECOMPOSITION; SEMANTICS OF NATURAL LANGUAGE;

SEMANTICS;

EID: 20844436347     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/exi003     Document Type: Conference Paper

References (7)

1. Dont Ben-Shalom. A tree characterization of generalized quantifier reducibility. In M. Kanazawa and C.J. Pinón, editors, Dynamics, Polarity and Quantification, number 48 in CSLI Lecture Notes, pages 147-171. CSLI, 1994.
2. J. van Benthem. Polyadic quantifiers. Linguistics and Philosophy, 12(4):437-464, 1989.
3. P. Dekker. Meanwhile, within the Frege boundary. Linguistics and Philosophy, 26:547-556, 2003.
4. E. Keenan. Unreducible n-ary quantification in natural language. In P. Gärdenfors, editor, Generalized Quantifiers, Linguistic and Logical Approaches, pages 109-150. Reidel, Dordrecht, 1987.
5. E. Keenan. Beyond the Frege boundary. Linguistics and Philosophy, 15(2):199-221, 1992.
6. E Keenan. Further beyond the Frege boundary. In J. van der Does and J. van Eijck, editors, Quantifiers, Logic, and Language, number 54 in CSLI Lecture Notes, pages 179-201. CSLI Publications, Stanford, 1996.
7. E. Keenan. Beyond the Frege boundary; II. http://www.folli.uva.nl/CD/ 1999/library/pdf/Fr-bdr2c.pdf, 1999.