Sentence examples for most countable collection from inspiring English sources

Let ({ G_{k}, k=1,2,ldots}) be at most countable collection of unbounded open subsets of ((0, infty)).

We prove the following rigidity result: if u∈SBV Ω,RN) is a deformation of Ω whose associated crack Ju has finite energy in the sense of Griffith's theory (i.e., HN−1(Ju)<∞), and whose approximate gradient ∇u is almost everywhere a rotation, then u is a collection of an at most countable family of rigid motions.

In general, nothing need be assumed about this set; in what follows, I will assume that E is at most countable, that is, that there are at most countably many evidence items.

Therefore, is at most countable.

He proved that if a countable collection of first-order sentences has an infinite model, then it has a model whose domain is only countable.

Σ ( A ) is at most countable.

Then (T_{mathrm{extr}}) is at most countable.

Skolem's Paradox arises when we notice that the standard axioms of set theory can themselves be formulated as (countable) collection of first-order sentences.

The set of all nonzero eigenvalues coincides with the at most countable set (Lambda').

Since V is one-to-one mapping on W, W is at most countable.

Therefore, its zeros form an at most countable set without finite limit points.