Also found in: Thesaurus, Encyclopedia, Wikipedia.


 (dĭ-no͞o′mər-ə-bəl, -nyo͞o′-)
Capable of being put into one-to-one correspondence with the positive integers; countable.

[From denumerate, to count, from Late Latin dēnumerāre, dēnumerāt-, alteration of Latin dīnumerāre : dī-, dis-, dis- + numerāre, to number; see numerate.]

de·nu′mer·a·bil′i·ty n.
de·nu′mer·a·bly adv.


(Mathematics) maths capable of being put into a one-to-one correspondence with the positive integers; countable
deˈnumerably adv


(ˈkaʊn tə bəl)

1. able to be counted.
2. Math.
a. (of a set) having a finite number of elements.
b. (of a set) having elements that form a one-to-one correspondence with the natural numbers; denumerable; enumerable.
count`a•bil′i•ty, count′a•ble•ness, n.
count′a•bly, adv.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Adj.1.denumerable - that can be counted; "countable sins"; "numerable assets"
calculable - capable of being calculated or estimated; "a calculable risk"; "calculable odds"
References in periodicals archive ?
Let us consider a combinatorial class F which is defined as a denumerable collection of objects built of atoms represented by X according to some well specified procedure.
Vasershtein, "Markov processes over denumerable products of spaces describing large system of automata," Problems of Information Transmission, vol.
Note that conditions (b) and (f) can be guaranteed if there exist either a finite set or sequence of nonnegative integer numbers [mathematical expression not reproducible] with [mathematical expression not reproducible] denoting the infinity cardinal of denumerable sets) and an associated set or sequence of nonnegative real numbers [mathematical expression not reproducible] such that
If for any complete preference subset of E, there is denumerable set {[x.sub.n]} [subset] M such that if x [member of] M, x [not equal to] sup M, there is [mathematical expression not reproducible], then E is said to be pseudo separable in incomplete preference.
It is well known that the function [lambda] [right arrow] min.ind(A - [lambda]) is constant on every component of [[PHI].sub.sf](A) (except perhaps for a denumerable subset without limit points in [[PHI].sub.sf] (A)) [11, Corollary 1.14]
Guo, Homogeneous Denumerable Markov Processes, Springer, Berlin, Germany, 1988.
Nunez-Queija, "Perturbation analysis for denumerable Markov chains with application to queueing models," Advances in Applied Probability, vol.
It is a state space that can be a limited and denumerable set or a nonempty set.
card(A) = [N.sub.0] indicates that the cardinal of a denumerable set A is infinite as opposed to card(A) = [infinity], denoting the infinity cardinal of a nondenumerable set A,
(We can assume that E does not contain points where [R.sub.n](t) = 0 because the set of such points is denumerable).
The path integrals are well-defined for systems with a denumerable number of degrees of freedom.