Resolve
RDF Terms

    Data based on @zazuko/vocabularies
    Defined by qudt:
    Click to Copy
    qudt:CardinalityType
    Click to Copy
    http://qudt.org/schema/qudt/CardinalityType

    Recommended prefix

    Copy 'PREFIX qudt: <http://qudt.org/schema/qudt/>'

    qudt:

    rdf: type
    owl:Class
    rdfs: label
    lang:""
    Cardinality Type
    rdfs: subClassOf
    qudt:EnumeratedValue
    dcterms: description
    lang:""

    In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set \(A = {2, 4, 6}\) contains 3 elements, and therefore \(A\) has a cardinality of 3. There are two approaches to cardinality – one which compares sets directly using bijections and injections, and another which uses cardinal numbers.

    lang:""
    In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set \(A = {2, 4, 6}\) contains 3 elements, and therefore \(A\) has a cardinality of 3. There are two approaches to cardinality – one which compares sets directly using bijections and injections, and another which uses cardinal numbers.
    owl: oneOf
    blank node
    blank node
    prov: wasInfluencedBy
    qudt: informativeReference
    lang:""
    http://en.wikipedia.org/wiki/Cardinal_number
    lang:""
    http://en.wikipedia.org/wiki/Cardinality
    qudt: plainTextDescription
    lang:""
    In mathematics, the cardinality of a set is a measure of the number of elements of the set. For example, the set 'A = {2, 4, 6}' contains 3 elements, and therefore 'A' has a cardinality of 3. There are two approaches to cardinality – one which compares sets directly using bijections and injections, and another which uses cardinal numbers.
    rdfs: isDefinedBy