Simple and simplest semi-orders (Q1420659)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simple and simplest semi-orders |
scientific article; zbMATH DE number 2035986
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple and simplest semi-orders |
scientific article; zbMATH DE number 2035986 |
Statements
Simple and simplest semi-orders (English)
0 references
2 February 2004
0 references
The author describes two new classes of partial orders, namely the simple and the simplest semi-orders. A semi-order is simple if it satisfies the weak condition of negative transitivity. A simple semi-order is the simplest if it satisfies the weak condition of differentiation of contours.
0 references
graphs
0 references
binary relations
0 references
orders
0 references
