Jump to content

Counting quantification

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 195.92.40.49 (talk) at 16:16, 1 July 2005 (Stubbed, wikified). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A counting quantifier is a mathematical term for a quantifier of the form "there exists at least k elements that satisfy property X".

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

Stub icon

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

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