Counting Function

(Redirected from Set Cardinality Function)
Jump to: navigation, search

A counting fuction is a unary integer-valued multiset measure function that represents the total number of members of a multiset.



  • (Wikipedia, 2017) ⇒ Retrieved:2017-2-13.
    • Counting is the action of finding the number of elements of a finite set of objects. The traditional way of counting consists of continually increasing a (mental or spoken) counter by a unit for every element of the set, in some order, while marking (or displacing) those elements to avoid visiting the same element more than once, until no unmarked elements are left; if the counter was set to one after the first object, the value after visiting the final object gives the desired number of elements. The related term enumeration refers to uniquely identifying the elements of a finite (combinatorial) set or infinite set by assigning a number to each element.

      Counting sometimes involves numbers other than one; for example, when counting money, counting out change, "counting by twos" (2, 4, 6, 8, 10, 12, ...), or "counting by fives" (5, 10, 15, 20, 25, ...).

      There is archeological evidence suggesting that humans have been counting for at least 50,000 years. [1] Counting was primarily used by ancient cultures to keep track of social and economic data such as number of group members, prey animals, property, or debts (i.e., accountancy). The development of counting led to the development of mathematical notation, numeral systems, and writing.

  1. An Introduction to the History of Mathematics (6th Edition) by Howard Eves (1990) p.9


  • (WordNet, 2009) ⇒
    • S: (n) count (the total number counted) "a blood count"
    • S: (n) count, counting, numeration, enumeration, reckoning, tally (the act of counting; reciting numbers in ascending order) "the counting continued for several hours"