Relation sumo#assignment_fn (pm#function_type,*)  if F is a function with a value for the objects denoted by N1,..., NK, then (sumo#assignmentFn F N1 ... NK) is the value of applying F to the objects denoted by N1,..., NK; otherwise, the value is undefined
  type:  pm#function_type  term-forming relation that maps from a n-tuple of arguments to a range and that associates this n-tuple with at most one range element; note that the range is a set_or_class, and each element of the range is an instance of the set_or_class
  type:  pm#variable_arity_relation_type  class of relations that do not have a fixed number of arguments
  supertype:  pm#relation_from_relation_type (pm#relation_type,*)
     supertype:  pm#relation_from_type (pm#type,*)  type of relations from a concept/relation type, i.e. in RDFS terminology, from a class or a property
        supertype:  pm#relation_from_collection (pm#collection,*)
           supertype:  pm#relation_from/to_thing_of_common_kind (*)  this type permits to categorize relations according to their signatures and hence
          offers (i) a concise way to set essential exclusion relations, and (ii) a systematic and easy-to-follow categorization
              supertype:  pm#relation__related_thing__relatedthing___related_with (*)  type for any relation (unary, binary, ..., *-ary) and instance of pm#relation_type
           supertype:  pm#what_relation (*)
              supertype:  pm#wh-/how_relation (*)  this type permits to categorize relations according to the usual who/what/why/where/when/how questions ; this is a traditional but very subjective and ineffective way of categorizing relations 
                 supertype:  pm#relation__related_thing__relatedthing___related_with (*)  type for any relation (unary, binary, ..., *-ary) and instance of pm#relation_type


Simple category search: