qudt:Tuple| Predicate | Object |
|---|---|
rdf:type |
owl:Class |
rdf:type |
rdfs:Class |
rdf:type |
sh:NodeShape |
dcterms:description |
The term Tuple originated as an abstraction of the sequence: single, double, triple, quadruple, quintuple, n-tuple. In mathematics, a tuple is a finite sequence (also known as an Ordered List of objects, each of a specified type. The n can be any non-negative integer. |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/datatype |
rdfs:isDefinedBy |
http://qudt.org/3.5.2/schema/shacl/datatype |
rdfs:label |
“Tuple” |
rdfs:subClassOf |
qudt:CompositeDatatype |
rdfs:subClassOf |
|
rdfs:subClassOf |
|
rdfs:subClassOf |
|
sh:property |
qudt:Tuple-elementType |
sh:property |
qudt:Tuple-elementTypeCount |
sh:property |
qudt:Tuple-length |