Counting quantification: Difference between revisions

Revision as of 15:48, 1 July 2005

Revision as of 16:16, 1 July 2005

Line 1:

A '''counting quantifier''' is a [[Mathematics|mathematical]] term for a [[quantifier]] of the form "there exists at least ''k'' elements" that satisfy certain property ''X''".

==References==

Line 5:

* Erich Graedel, Martin Otto, and Eric Rosen. "Two-Variable Logic with Counting is Decidable." In Proceedings of 12th IEEE Symposium on Logic in Computer Science LICS `97, Warschau. 1997.

http://www-mgi.informatik.rwth-aachen.de/Publications/pub/graedel/gorc2.ps

{{math-stub}}