`qudt:CardinalityType`

http://qudt.org/schema/qudt/CardinalityType

Incoming relations

Types: owl:Class, rdfs:Class, sh:NodeShape

Predicate	Object
`rdf:type`	`owl:Class`
`rdf:type`	`rdfs:Class`
`rdf:type`	`sh:NodeShape`
`dcterms:description`	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`	`datatype:CT_COUNTABLY-INFINITE` `datatype:CT_UNCOUNTABLE` `datatype:CT_FINITE`
`prov:wasInfluencedBy`	http://en.wikipedia.org/wiki/Cardinal_number
`prov:wasInfluencedBy`	http://en.wikipedia.org/wiki/Cardinality
`qudt:informativeReference`	https://en.wikipedia.org/wiki/Cardinal_number
`qudt:informativeReference`	https://en.wikipedia.org/wiki/Cardinality
`qudt:plainTextDescription`	“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`	http://qudt.org/3.5.2/schema/datatype
`rdfs:isDefinedBy`	http://qudt.org/3.5.2/schema/shacl/datatype
`rdfs:label`	“Cardinality Type”
`rdfs:subClassOf`	`qudt:EnumeratedValue`
`rdfs:subClassOf`	`rdf:type` `owl:Restriction` `owl:maxCardinality` 1 `owl:onProperty` `dtype:literal`
`sh:in`	`datatype:CT_COUNTABLY-INFINITE` `datatype:CT_UNCOUNTABLE` `datatype:CT_FINITE`
`sh:property`	`qudt:CardinalityType-literal`
`sh:property`	`rdf:type` `sh:PropertyShape` `rdfs:isDefinedBy` http://qudt.org/3.5.2/schema/shacl/datatype `sh:in` `datatype:CT_COUNTABLY-INFINITE` `datatype:CT_FINITE` `datatype:CT_UNCOUNTABLE` `sh:path` ↳ `sh:inversePath` `rdf:type`

Generated 2026-09-22T13:15:48.343+00:00