|
Relationships
|
|
|
|
| Parents |
inheritable relation |
The class of Relations whose properties can be inherited downward in the class hierarchy via the subrelation Predicate.
|
| |
relation |
The Class of relations. There are two kinds of Relation: Predicate and Function. Predicates and Functions both denote sets of ordered n-tuples. The difference between these two Classes is that Predicates cover formula-forming operators, while Functions cover term-forming operators.
|
| Children |
binary predicate | A Predicate relating two items - its valence is two. |
| | closed world predicate | |
| | logical operator | This Class comprises all of the logical operators (viz. 'and', 'or', 'not', '=>', and '<=>'). |
| | quaternary predicate | The Class of Predicates that require four arguments. |
| | quintary predicate | The Class of Predicates that require five arguments. |
| | ternary predicate | The Class of Predicates that require exactly three arguments. |
| Instances | contrary attribute | A contraryAttribute is a set of Attributes such that something can not simultaneously have more than one of these Attributes. For example, (contraryAttribute Pliable Rigid) means that nothing can be both Pliable and Rigid. |
| | disjoint decomposition | A disjointDecomposition of a Class C is a set of subclasses of C that are mutually disjoint. |
| | exhaustive attribute | This predicate relates a Class to a set of Attributes, and it means that the elements of this set exhaust the instances of the Class. For example, (exhaustiveAttribute PhysicalState Solid Fluid Liquid Gas Plasma) means that there are only five instances of the class PhysicalState, viz. Solid, Fluid, Liquid, Gas and Plasma. |
| | exhaustive decomposition | An exhaustiveDecomposition of a Class C is a set of subclasses of C such that every instance of C is an instance of one of the subclasses in the set. Note: this does not necessarily mean that the elements of the set are disjoint (see partition - a partition is a disjoint exhaustive decomposition). |
| | partition | A partition of a Class C is a set of mutually disjoint classes (a subclass partition) which covers C. Every instance of C is an instance of exactly one of the subclasses in the partition. |
| | process list | The arguments of this relation are data structures, each of which contains the information necessary for the process already loaded by the operating system to execute on a processor. |