Simple Browser : Welcome guest : log in		 [  Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term: 

  PartialOrderingRelation

 Sigma KEE - PartialOrderingRelation
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
partial ordering relation
A BinaryRelation is a partial ordering if it is a ReflexiveRelation, an AntisymmetricRelation, and a TransitiveRelation.
Relationships      
Parents antisymmetric relation BinaryRelation ?REL is an AntisymmetricRelation if for distinct ?INST1 and ?INST2, (?REL ?INST1 ?INST2) implies not (?REL ?INST2 ?INST1). In other words, for all ?INST1 and ?INST2, (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST1) imply that ?INST1 and ?INST2 are identical. Note that it is possible for an AntisymmetricRelation to be a ReflexiveRelation.
  reflexive relation Relation ?REL is reflexive iff (?REL ?INST ?INST) for all ?INST.
  total valued relation A Relation is a TotalValuedRelation just in case there exists an assignment for the last argument position of the Relation given any assignment of values to every argument position except the last one. Note that declaring a Relation to be both a TotalValuedRelation and a SingleValuedRelation means that it is a total function.
  transitive relation A BinaryRelation ?REL is transitive if (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST3) imply (?REL ?INST1 ?INST3), for all ?INST1, ?INST2, and ?INST3.
Children total ordering relationA BinaryRelation is a TotalOrderingRelation if it is a PartialOrderingRelation and a TrichotomizingRelation.


Show full definition (without tree view)
Show full definition (with tree view)

Show without tree


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is open source software produced by Articulate Software and its partners