Jump to content

Counting quantification

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 128.30.64.46 (talk) at 15:48, 1 July 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A counting quantifier is a quantifier of the form "there exists at least k elements" that satisfy certain property.

References

  • 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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Counting_quantification&oldid=17961050"