Ontology of Datatypes

Last uploaded: March 4, 2024
Jump to:
Preferred Name

boundedness
Synonyms
Definitions

A datatype is said to be bounded above if it is ordered and there is a value U in the value space such that, for all values s in the value space, s ≤ U . The value U is then said to be an upper bound of the value space. Similarly, a datatype is said to be bounded below if it is ordered and there is a value L in the space such that, for all values s in the value space, L ≤ s . The value L is then said to be a lower bound of the value space. A datatype is said to be bounded if its value space has both an upper bound and a lower bound.
ID

http://ontodm.com/OntoDT#OntoDT_396145
CN_pl

OntoDT_396145s
CN_sg

OntoDT_396145
IAO_0000115

A datatype is said to be bounded above if it is ordered and there is a value U in the value space such that, for all values s in the value space, s ≤ U . The value U is then said to be an upper bound of the value space. Similarly, a datatype is said to be bounded below if it is ordered and there is a value L in the space such that, for all values s in the value space, L ≤ s . The value L is then said to be a lower bound of the value space. A datatype is said to be bounded if its value space has both an upper bound and a lower bound.
label

boundedness
prefLabel

boundedness
disjointWith

http://ontodm.com/OntoDT#OntoDT_905914
subClassOf

http://ontodm.com/OntoDT#OntoDT_387093
Add comment
Add proposal
Delete Subject Author Type Created
No notes to display