Deductions
- next lower rank has quality superclass ⇐ (next lower rank has quality property constraint), (property constraint has quality superclass), (has quality is a transitive relation)
- next lower rank has quality class ⇐ (next lower rank has quality property constraint), (property constraint has quality class), (has quality is a transitive relation)
- next lower rank has quality class ⇐ (quality is a class), (next lower rank has quality quality)
- next lower rank has quality expression ⇐ (next lower rank has quality property constraint), (property constraint has quality expression), (has quality is a transitive relation)
- next lower rank has quality number of entities ⇐ (next lower rank has quality property constraint), (property constraint has quality number of entities), (has quality is a transitive relation)
- next lower rank has quality superclass ⇐ (next lower rank has quality property constraint), (property constraint has quality superclass), (has quality is a transitive relation)
- next lower rank has quality type ⇐ (next lower rank has quality property constraint), (property constraint has quality type), (has quality is a transitive relation)
- next lower rank has quality criterion ⇐ (next lower rank has quality property constraint), (property constraint has quality criterion), (has quality is a transitive relation)
- next lower rank has quality set ⇐ (next lower rank has quality property constraint), (property constraint has quality set), (has quality is a transitive relation)
- next lower rank has quality entity ⇐ (next lower rank has quality property constraint), (property constraint has quality entity), (has quality is a transitive relation)
- next lower rank has quality arity ⇐ (next lower rank has quality property constraint), (property constraint has quality arity), (has quality is a transitive relation)
- next lower rank has quality abstract entity ⇐ (next lower rank has quality property constraint), (property constraint has quality abstract entity), (has quality is a transitive relation)
- next lower rank has quality truth value ⇐ (next lower rank has quality property constraint), (property constraint has quality truth value), (has quality is a transitive relation)
- next lower rank has quality computer science term ⇐ (next lower rank has quality property constraint), (property constraint has quality computer science term), (has quality is a transitive relation)
- next lower rank has quality property ⇐ (next lower rank has quality property constraint), (property constraint has quality property), (has quality is a transitive relation)
- next lower rank has quality value ⇐ (next lower rank has quality property constraint), (property constraint has quality value), (has quality is a transitive relation)
- next lower rank has quality relation ⇐ (next lower rank has quality property constraint), (property constraint has quality relation), (has quality is a transitive relation)
- next lower rank has quality mathematical property ⇐ (next lower rank has quality property constraint), (property constraint has quality mathematical property), (has quality is a transitive relation)
- next lower rank has quality taxonomic rank ⇐ (next lower rank has quality property constraint), (property constraint has quality taxonomic rank), (has quality is a transitive relation)
- next lower rank has quality existence ⇐ (next lower rank has quality property constraint), (property constraint has quality existence), (has quality is a transitive relation)
- next lower rank has quality mathematical object ⇐ (next lower rank has quality property constraint), (property constraint has quality mathematical object), (has quality is a transitive relation)
- next lower rank has quality quality ⇐ (next lower rank has quality property constraint), (property constraint has quality quality), (has quality is a transitive relation)
- next lower rank has quality class ⇐ (next lower rank has quality property constraint), (property constraint has quality class), (has quality is a transitive relation)
- next lower rank has quality type of property ⇐ (next lower rank has quality property constraint), (property constraint has quality type of property), (has quality is a transitive relation)
- next lower rank has quality value-requires-statement constraint ⇐ (next lower rank is a Wikibase property), (Wikibase property has quality value-requires-statement constraint)
- next lower rank has quality property constraint ⇐ (next lower rank is a Wikibase property), (Wikibase property has quality property constraint)
- Wikibase property is for example next lower rank ⇐ (next lower rank is a Wikibase property), (is a is inverse of is for example)
- -> is for example next lower rank ⇐ (next lower rank is a ->), (is a is inverse of is for example)
- next lower rank is a Wikibase property ⇐ (-> is subclass of Wikibase property), (next lower rank is a ->)