Work in progress

<rdf:RDF
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:j.0="http://qudt.org/schema/qudt/"
    xmlns:j.1="http://purl.org/dc/terms/"
    xmlns:j.2="http://www.linkedmodel.org/schema/dtype#"
    xmlns:owl="http://www.w3.org/2002/07/owl#"
    xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="http://qudt.org/schema/qudt/CT_COUNTABLY-INFINITE">
    <j.1:description rdf:datatype="http://qudt.org/schema/qudt/LatexString">
  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.
  </j.1:description>
    <rdfs:isDefinedBy rdf:resource="http://qudt.org/2.1/schema/qudt"/>
    <rdf:type rdf:resource="http://qudt.org/schema/qudt/CardinalityType"/>
    <j.1:description rdf:datatype="http://qudt.org/schema/qudt/LatexString">
  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.
  </j.1:description>
    <j.2:literal>countable</j.2:literal>
    <j.0:informativeReference rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">http://www.math.vanderbilt.edu/~schectex/courses/infinity.pdf</j.0:informativeReference>
    <rdfs:isDefinedBy rdf:resource="http://qudt.org/2.1/schema/shacl/datatype"/>
    <rdfs:label>Countably Infinite Cardinality Type</rdfs:label>
  </rdf:Description>
</rdf:RDF>

@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<http://qudt.org/schema/qudt/CT_COUNTABLY-INFINITE>
  rdf:type <http://qudt.org/schema/qudt/CardinalityType> ;
  <http://purl.org/dc/terms/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.
  """^^<http://qudt.org/schema/qudt/LatexString> ;
  <http://purl.org/dc/terms/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.
  """^^<http://qudt.org/schema/qudt/LatexString> ;
  <http://qudt.org/schema/qudt/informativeReference> "http://www.math.vanderbilt.edu/~schectex/courses/infinity.pdf"^^xsd:anyURI ;
  <http://www.linkedmodel.org/schema/dtype#literal> "countable" ;
  rdfs:isDefinedBy <http://qudt.org/2.1/schema/qudt> ;
  rdfs:isDefinedBy <http://qudt.org/2.1/schema/shacl/datatype> ;
  rdfs:label "Countably Infinite Cardinality Type" ;
.

{"resource":"Countably Infinite Cardinality Type" 
 ,"qname":"qudt:CT_COUNTABLY-INFINITE" 
 ,"uri":"http:\/\/qudt.org\/schema\/qudt\/CT_COUNTABLY-INFINITE" 
 ,"properties":["description":"\n  A set of numbers is called countably infinite if there is a way to enumerate them.\n  Formally this is done with a bijection function that associates each number in the set with exactly one of the positive integers.\n  The set of all fractions is also countably infinite.\n  In other words, any set $X$ that has the same cardinality as the set of the natural numbers,\n   or $| X | \\; =  \\; | \\mathbb N | \\; = \\; \\aleph0$, is said to be a countably infinite set.\n  " 
    ,"description":"\n  A set of numbers is called countably infinite if there is a way to enumerate them. \n  Formally this is done with a bijection function that associates each number in the set with exactly one of the positive integers.\n  The set of all fractions is also countably infinite.\n  In other words, any set $X$ that has the same cardinality as the set of the natural numbers,\n   or $| X | \\; =  \\; | \\mathbb N | \\; = \\; \\aleph0$, is said to be a countably infinite set.\n  " 
    ,"informative reference":"http:\/\/www.math.vanderbilt.edu\/~schectex\/courses\/infinity.pdf" 
    ,"isDefinedBy":"<http:\/\/qudt.org\/2.1\/schema\/qudt>" 
    ,"isDefinedBy":"<http:\/\/qudt.org\/2.1\/schema\/shacl\/datatype>" 
    ,"label":"Countably Infinite Cardinality Type" 
    ,"literal":"countable" 
    ,"type":"qudt:CardinalityType" 
    ]}

{
  "@id" : "http://qudt.org/schema/qudt/CT_COUNTABLY-INFINITE",
  "@type" : "http://qudt.org/schema/qudt/CardinalityType",
  "description" : [ "\n  A set of numbers is called countably infinite if there is a way to enumerate them. \n  Formally this is done with a bijection function that associates each number in the set with exactly one of the positive integers.\n  The set of all fractions is also countably infinite.\n  In other words, any set $X$ that has the same cardinality as the set of the natural numbers,\n   or $| X | \\; =  \\; | \\mathbb N | \\; = \\; \\aleph0$, is said to be a countably infinite set.\n  ", "\n  A set of numbers is called countably infinite if there is a way to enumerate them.\n  Formally this is done with a bijection function that associates each number in the set with exactly one of the positive integers.\n  The set of all fractions is also countably infinite.\n  In other words, any set $X$ that has the same cardinality as the set of the natural numbers,\n   or $| X | \\; =  \\; | \\mathbb N | \\; = \\; \\aleph0$, is said to be a countably infinite set.\n  " ],
  "informativeReference" : "http://www.math.vanderbilt.edu/~schectex/courses/infinity.pdf",
  "literal" : "countable",
  "isDefinedBy" : [ "http://qudt.org/2.1/schema/qudt", "http://qudt.org/2.1/schema/shacl/datatype" ],
  "label" : "Countably Infinite Cardinality Type",
  "@context" : {
    "description" : {
      "@id" : "http://purl.org/dc/terms/description",
      "@type" : "http://qudt.org/schema/qudt/LatexString"
    },
    "isDefinedBy" : {
      "@id" : "http://www.w3.org/2000/01/rdf-schema#isDefinedBy",
      "@type" : "@id"
    },
    "literal" : {
      "@id" : "http://www.linkedmodel.org/schema/dtype#literal"
    },
    "informativeReference" : {
      "@id" : "http://qudt.org/schema/qudt/informativeReference",
      "@type" : "http://www.w3.org/2001/XMLSchema#anyURI"
    },
    "label" : {
      "@id" : "http://www.w3.org/2000/01/rdf-schema#label"
    },
    "rdf" : "http://www.w3.org/1999/02/22-rdf-syntax-ns#",
    "owl" : "http://www.w3.org/2002/07/owl#",
    "xsd" : "http://www.w3.org/2001/XMLSchema#",
    "rdfs" : "http://www.w3.org/2000/01/rdf-schema#"
  }
}