- countably infinite
Wikipedia foundation.
Wikipedia foundation.
Infinite set — In set theory, an infinite set is a set that is not a finite set. Infinite sets may be countable or uncountable. Some examples are: * the set of all integers, {..., 1, 0, 1, 2, ...}, is a countably infinite set; and * the set of all real numbers… … Wikipedia
countably — ˈkau̇n(t)əblē adverb : in a way that is countable a countably infinite subset … Useful english dictionary
infinite series — noun A sum with a countably infinite number of ordered summands; the sum itself is formally defined as the limit of the partial sums, if it exists … Wiktionary
Dedekind-infinite set — In mathematics, a set A is Dedekind infinite if some proper subset B of A is equinumerous to A. Explicitly, this means that there is a bijective function from A onto some proper subset B of A. A set is Dedekind finite if it is not Dedekind… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Countable set — Countable redirects here. For the linguistic concept, see Count noun. Not to be confused with (recursively) enumerable sets. In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of… … Wikipedia
Hilbert's paradox of the Grand Hotel — is a mathematical paradox about infinite sets presented by German mathematician David Hilbert (1862–1943). The Paradox of the Grand Hotel Consider a hypothetical hotel with infinitely many rooms, all of which are occupied that is to say every… … Wikipedia
Hilbert space — For the Hilbert space filling curve, see Hilbert curve. Hilbert spaces can be used to study the harmonics of vibrating strings. The mathematical concept of a Hilbert space, named after David Hilbert, generalizes the notion of Euclidean space. It… … Wikipedia
Rado graph — The Rado graph, as numbered by Rado (1964). In the mathematical field of graph theory, the Rado graph, also known as the random graph or the Erdős–Renyi graph, is the unique (up to isomorphism) countable graph R such that for any finite graph G… … Wikipedia
Examples of vector spaces — This page lists some examples of vector spaces. See vector space for the definitions of terms used on this page. See also: dimension, basis. Notation . We will let F denote an arbitrary field such as the real numbers R or the complex numbers C.… … Wikipedia