- Author
- Title
- Quantifiers in TIME and SPACE : computational complexity of generalized quantifiers in natural language
- Supervisors
- Co-supervisors
- Award date
- 6 March 2009
- Number of pages
- 232
- Publisher
- Amsterdam: Institute for Logic, Language and Computation
- ISBN
- 9789057761874
- Document type
- PhD thesis
- Faculty
- Interfacultary Research
- Institute
- Institute for Logic, Language and Computation (ILLC)
- Note
- Research conducted at: Universiteit van Amsterdam
- Persistent Identifier
- https://hdl.handle.net/11245/1.295066
- Downloads
-
Thesis
Cover
Titlepage
Contents
Acknowledgments
Introduction
Chapter 1 Algorithmic semantics
Chapter 2 Mathematical prerequisites
Chapter 3 Complexity of polyadic quantifiers
Chapter 4 Complexity of quantified reciprocals
Chapter 5 Complexity of collective quantification
Chapter 6 Hintikka's thesis revisited
Chapter 7 Comprehension of simple quantifiers
Chapter 8 Conclusions and perspectives
Appendix A English version of the test from chapter 6
Appendix B Polish version of the test from chapter 6
Bibliography
Index
Samenvatting
Abstract
Titles in the ILLC Dissertation Series
Disclaimer/Complaints regulations
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.