Quantifiers in TIME and SPACE : computational complexity of generalized quantifiers in natural language

Authors	J.K. Szymanik
Supervisors	J.F.A.K. van Benthem M. Mostowski
Cosupervisors	T.M.V. Janssen
Award date	06-03-2009
ISBN	9789057761874
Number of pages	232
Publisher	Amsterdam: Institute for Logic, Language and Computation
Organisations	Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Document type	PhD thesis
Note	Research conducted at: Universiteit van Amsterdam
Language	English
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
Permalink to this page

Back

UvA-DARE