datatype:CT_COUNTABLY-INFINITE
http://qudt.org/vocab/datatype/CT_COUNTABLY-INFINITE
Types:
qudt:CardinalityType| Predicate | Object |
|---|---|
rdf:type |
qudt:CardinalityType |
dcterms: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. |
dtype:literal |
“countable” |
qudt:informativeReference |
http://www.math.vanderbilt.edu/~schectex/courses/infinity.pdf |
rdfs:isDefinedBy |
http://qudt.org/3.4.0/vocab/datatype |
rdfs:label |
“Countably Infinite Cardinality Type” |
Generated 2026-06-25T12:40:39.187+00:00