Deductions
- finite set has quality class ⇐ (finite set has quality type), (type has quality class), (has quality is a transitive relation)
- finite set has quality abstract entity ⇐ (type is a abstract entity), (finite set has quality type)
- finite set has quality quality ⇐ (finite set is subclass of set), (set has quality quality)
- finite set has quality type ⇐ (finite set is subclass of set), (set has quality type)
- finite set has quality property ⇐ (finite set is subclass of set), (set has quality property)
- finite set has quality criterion ⇐ (finite set is subclass of set), (set has quality criterion)
- finite set has quality taxonomic rank ⇐ (finite set is subclass of set), (set has quality taxonomic rank)
- finite set has quality superclass ⇐ (finite set is subclass of set), (set has quality superclass)
- finite set has quality existence ⇐ (finite set is subclass of set), (set has quality existence)
- finite set has quality entity ⇐ (finite set is subclass of set), (set has quality entity)
- finite set has quality type of property ⇐ (finite set is subclass of set), (set has quality type of property)
- finite set has part element ⇐ (finite set is subclass of set), (set has part element)
- finite set is subclass of set ⇐ (infinite set is subclass of set), (infinite set is opposite of finite set)
- infinite set is opposite of finite set ⇐ finite set is opposite of infinite set
- finite set is for example Boolean domain ⇐ (Boolean domain is a finite set), (is a is inverse of is for example)