Almost All Complex Quantifiers Are Simple

View Related Documents

Journal Article
Symmetric and contrapositional quantifiers
R. Zuber
Journal of Logic, Language and Information, 2007, Volume 16, Number 1, Pages 1-13
- Download PDF (147.6 KB)
Journal Article
Minimal Recursion Semantics: An Introduction
Ann Copestake, Dan Flickinger, Carl Pollard and Ivan A. Sag
Research on Language & Computation, 2005, Volume 3, Numbers 2-3, Pages 281-332
- Download PDF (829.8 KB)
Journal Article
Directions in generalized quantifier theory
Johan van Benthem and Dag Westerståhl
Studia Logica, 1995, Volume 55, Number 3, Pages 389-419
- Download PDF (2.2 MB)
Book Chapter
Sharper results on the expressive power of generalized quantifiers
Anil Seth
Lecture Notes in Computer Science, 1997, Volume 1346, Foundations of Software Technology and Theoretical Computer Science, Pages 200-219
- Download PDF (1.1 MB)
Book Chapter
Adverbs of Completion in an Event Semantics
Christopher Piñón
Studies in Theoretical Psycholinguistics, 2006, Volume 32, Perspectives on Aspect, Pages 149-166
- Download PDF (1.0 MB)
Book Chapter
Natural language processing, complexity theory and logic
Akshar Bharati, Rajeev Sangal and Vineet Chaitanya
Lecture Notes in Computer Science, 1990, Volume 472, Foundations of Software Technology and Theoretical Computer Science, Pages 410-420
- Download PDF (538.2 KB)
Book Chapter
Computational semantics: Steps towards “intelligent” text processing
Jens Erik Fenstad and Jan Tore Lønning
Lecture Notes in Computer Science, 1990, Volume 459, Natural Language and Logic, Pages 70-93
- Download PDF (1.9 MB)
Book Chapter
Basic aspects of the theory of generalized quantifiers
João Peres
Lecture Notes in Computer Science, 1991, Volume 476, Natural Language Processing, Pages 141-157
- Download PDF (1.2 MB)
Book Chapter
A reduction of the theory of confirmation to the notions of distance and measure
Karl Schlechta
Lecture Notes in Computer Science, 1995, Volume 946, Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Pages 387-394
- Download PDF (523.9 KB)
Book Chapter
QLGQ: A Query Language with Generalized Quantifiers
Antonio Badia
The Kluwer International Series on Advances in Database Systems, 1, Volume 37, Quantifiers in Action, Pages 37-53
- Download PDF (585.8 KB)

Abstract

We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.

Keywords generalized quantifiers - computational complexity - polyadic quantifiers - Boolean combinations - iteration - cumulation - resumption

Fulltext Preview

Image of the first page of the fulltext document

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

SpringerLink

Almost All Complex Quantifiers Are Simple

View Related Documents

Abstract

Fulltext Preview