@prefix afn: . @prefix arg: . @prefix constant: . @prefix corpus: . @prefix corpusprojects: . @prefix creativecommons: . @prefix crosswalkprojects: . @prefix dash: . @prefix datagraph: . @prefix datatype: . @prefix dc: . @prefix dcam: . @prefix dct: . @prefix dcterms: . @prefix dtype: . @prefix edg: . @prefix edg.v: . @prefix fn: . @prefix foaf: . @prefix functions: . @prefix geo: . @prefix graphql: . @prefix html: . @prefix mc: . @prefix metadata: . @prefix metash: . @prefix nist: . @prefix oecc: . @prefix ontologyprojects: . @prefix org: . @prefix owl: . @prefix prefix: . @prefix prov: . @prefix qkdv: . @prefix quantity: . @prefix quantitykind: . @prefix qudt: . @prefix qudt.type: . @prefix qudt_ads_services: . @prefix qudt_owl_schema: . @prefix raci: . @prefix rdf: . @prefix rdfs: . @prefix rdm: . @prefix rdmfact: . @prefix rdmprojects: . @prefix s3: . @prefix search: . @prefix sh: . @prefix si-constant: . @prefix si-prefix: . @prefix si-quantity: . @prefix si-unit: . @prefix sioc: . @prefix skos: . @prefix skosshapes: . @prefix skosxl: . @prefix smf: . @prefix softwareprojects: . @prefix soqk: . @prefix sou: . @prefix sp: . @prefix sparql: . @prefix spif: . @prefix spin: . @prefix spl: . @prefix spr: . @prefix swa: . @prefix swash: . @prefix taggerprojects: . @prefix taxonomies: . @prefix teamwork: . @prefix teamworkconstraints: . @prefix tosh: . @prefix ui: . @prefix unit: . @prefix vaem: . @prefix voag: . @prefix vs: . @prefix wot: . @prefix xsd: . qudt:CT_COUNTABLY-INFINITE 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."^^qudt:LatexString ; 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."^^qudt:LatexString ; qudt:informativeReference "http://www.math.vanderbilt.edu/~schectex/courses/infinity.pdf"^^xsd:anyURI ; qudt:literal "countable" ; rdfs:isDefinedBy ; rdfs:isDefinedBy ; rdfs:label "Countably Infinite Cardinality Type" ; .