 qudt:CT_COUNTABLY-INFINITE

Type
Description

A set of numbers is called countably infinite if there is a way to enumerate them. Formally this is done with a bijection function that associates each number in the set with exactly one of the positive integers. The set of all fractions is also countably infinite. In other words, any set $$X$$ that has the same cardinality as the set of the natural numbers, or $$| X | \; = \; | \mathbb N | \; = \; \aleph0$$, is said to be a countably infinite set.

Properties
countable
Annotations
A set of numbers is called countably infinite if there is a way to enumerate them. Formally this is done with a bijection function that associates each number in the set with exactly one of the positive integers. The set of all fractions is also countably infinite. In other words, any set $$X$$ that has the same cardinality as the set of the natural numbers, or $$| X | \; = \; | \mathbb N | \; = \; \aleph0$$, is said to be a countably infinite set.
Countably Infinite Cardinality Type

Generated 2023-08-28T11:21:52.684-04:00 by lmdoc version 1.1 with  TopBraid SPARQL Web Pages (SWP)