Strictly Ordered Set - kipawaa/Proof-Tree GitHub Wiki

Statement

The pair $(A, <)$ is a strictly ordered set iff $<$ is a Strict Ordering of $A$.

Explanation

Proof(s)

History

Applications

Links

Dependencies

• Strict Ordering

Dependents

Sources

• Hrbacek, K., & Jech, T. (1999). Introduction to Set Theory, Revised and Expanded (3rd ed.). CRC Press. https://doi.org/10.1201/9781315274096