enumerability

That is, the proof proves non-enumerability: it proves that for any given definite real number concept (e.g., recursive real), one cannot enumerate ˜all™ such numbers because one can always construct a diagonal number, which falls under the same concept and is not in the enumeration.

Wittgenstein's Philosophy of Mathematics Rodych, Victor 2007

(LFM 103), we will find, Wittgenstein expects, that set theory is uninteresting (e.g., that the non-enumerability of “the reals” is uninteresting and useless) and that our entire interest in it lies in the ˜charm™ of the mistaken prose interpretation of its proofs (LFM 16).

Wittgenstein's Philosophy of Mathematics Rodych, Victor 2007

So to be even more explicit, here's the enumerability vs. event ordering:

MSDN Blogs 2010

Golden rule: An ID's enumerability status shall change before the corresponding load/unload event is fired.

MSDN Blogs 2010

Golden rule: An ID's enumerability status shall change before the corresponding load/unload event is fired.

MSDN Blogs 2010

It is also related to locatedness in constructive analysis and recursive enumerability in recursion theory.

Lambda the Ultimate - Programming Languages Weblog 2010

So to be even more explicit, here's the enumerability vs. event ordering:

MSDN Blogs 2010

Church thesis for fuzzy set theory claiming that the proposed notion of recursive enumerability for fuzzy subsets is the adequate one.

Citizendium, the Citizens' Compendium - Recent changes [en] 2009

Church thesis for fuzzy set theory claiming that the proposed notion of recursive enumerability for fuzzy subsets is the adequate one.

Citizendium, the Citizens' Compendium - Recent changes [en] 2009

Church thesis for fuzzy set theory claiming that the proposed notion of recursive enumerability for fuzzy subsets is the adequate one.

Citizendium, the Citizens' Compendium - Recent changes [en] 2009