Deductions
- set operation has quality class ⇐ (set is a class), (set operation has quality set)
- set operation has quality class ⇐ (quality is a class), (set operation has quality quality)
- set operation has quality quality ⇐ (set operation has quality set), (set has quality quality), (has quality is a transitive relation)
- set operation has quality type ⇐ (set operation has quality set), (set has quality type), (has quality is a transitive relation)
- set operation has quality property ⇐ (set operation has quality set), (set has quality property), (has quality is a transitive relation)
- set operation has quality criterion ⇐ (set operation has quality set), (set has quality criterion), (has quality is a transitive relation)
- set operation has quality type of property ⇐ (set operation has quality set), (set has quality type of property), (has quality is a transitive relation)
- set operation has quality class ⇐ (set is a class), (set operation has quality set)
- set operation has quality taxonomic rank ⇐ (set operation has quality mathematical object), (mathematical object has quality taxonomic rank), (has quality is a transitive relation)
- set operation has quality relation ⇐ (set operation has quality mathematical object), (mathematical object has quality relation), (has quality is a transitive relation)
- set operation has quality set ⇐ (set operation has quality mathematical object), (mathematical object has quality set), (has quality is a transitive relation)
- set operation has quality superclass ⇐ (set operation has quality mathematical object), (mathematical object has quality superclass), (has quality is a transitive relation)
- set operation has quality mathematical property ⇐ (set operation has quality mathematical object), (mathematical object has quality mathematical property), (has quality is a transitive relation)
- set operation has quality entity ⇐ (set operation has quality mathematical object), (mathematical object has quality entity), (has quality is a transitive relation)
- set operation has quality existence ⇐ (set operation has quality mathematical object), (mathematical object has quality existence), (has quality is a transitive relation)
- set operation has quality abstract entity ⇐ (arity is a abstract entity), (set operation has quality arity)
- set operation has quality mathematical object ⇐ (arity is a mathematical object), (set operation has quality arity)
- set operation is for example Cartesian product ⇐ (Cartesian product is a set operation), (is a is inverse of is for example)
- set operation is for example intersection ⇐ (intersection is a set operation), (is a is inverse of is for example)
- set operation is for example union ⇐ (union is a set operation), (is a is inverse of is for example)
- set operation is subclass of entity ⇐ (set operation is subclass of operation), (operation is subclass of entity), (is subclass of is a transitive relation)
- set operation is subclass of abstract entity ⇐ (set operation is subclass of operation), (operation is subclass of abstract entity), (is subclass of is a transitive relation)
- set operation is subclass of class ⇐ (set operation is subclass of operation), (operation is subclass of class), (is subclass of is a transitive relation)
- set operation is subclass of relation ⇐ (set operation is subclass of operation), (operation is subclass of relation), (is subclass of is a transitive relation)
- set operation is subclass of mathematical object ⇐ (set operation is subclass of operation), (operation is subclass of mathematical object), (is subclass of is a transitive relation)
- set operation is subclass of set ⇐ (set operation is subclass of operation), (operation is subclass of set), (is subclass of is a transitive relation)
- set operation is subclass of binary relation ⇐ (set operation is subclass of operation), (operation is subclass of binary relation), (is subclass of is a transitive relation)
- set operation is subclass of function ⇐ (set operation is subclass of operation), (operation is subclass of function), (is subclass of is a transitive relation)
- set operation has quality number of entities ⇐ (arity is subclass of number of entities), (set operation has quality arity)
- intersection is a set operation ⇐ (union is a set operation), (union is opposite of intersection)