upper and lower bounds (Q1421): Difference between revisions
Jump to navigation
Jump to search
Created a new Item: upper and lower bounds, every element of a partially ordered set A which is greater (resp. lower) than every element of a subset B included in A |
Created claim: subclass of (P1): binary relation (Q332) |
||
| (One intermediate revision by the same user not shown) | |||
| Property / instance of | |||
| Property / instance of: Wikipedia article covering multiple topics / rank | |||
Normal rank | |||
| Property / subclass of | |||
| Property / subclass of: binary relation / rank | |||
Normal rank | |||
Latest revision as of 22:58, 30 January 2023
every element of a partially ordered set A which is greater (resp. lower) than every element of a subset B included in A
- majoring or minoring element
- Upper bounds
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | upper and lower bounds |
every element of a partially ordered set A which is greater (resp. lower) than every element of a subset B included in A |
|