The stars in the sky are uncountably many, even a life time would not suffice to number them all.
If a set is neither finite nor countably infinite, it is said to be uncountably infinite or simply uncountable.
Wikipedia foundation.
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Von Neumann algebra — In mathematics, a von Neumann algebra or W* algebra is a * algebra of bounded operators on a Hilbert space that is closed in the weak operator topology and contains the identity operator. They were originally introduced by John von Neumann,… … 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
Sequence space — In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … 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
Continuous game — A continuous game is a mathematical generalization, used in game theory. It extends the notion of a discrete game, where the players choose from a finite set of pure strategies. The continuous game concepts allows games to include more general… … Wikipedia
Connected space — For other uses, see Connection (disambiguation). Connected and disconnected subspaces of R² The green space A at top is simply connected whereas the blue space B below is not connected … Wikipedia
Definable real number — A real number a is first order definable in the language of set theory, without parameters, if there is a formula φ in the language of set theory, with one free variable, such that a is the unique real number such that φ(a) holds in the standard… … Wikipedia
