OpenMath is an extensible standard for representing the semantics of mathematical objects.
OpenMath is an extensible standard for representing the semantics of mathematical objects.
This document is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
The copyright holder grants you permission to redistribute this
document freely as a verbatim copy. Furthermore, the copyright
holder permits you to develop any derived work from this document
provided that the following conditions are met.
a) The derived work acknowledges the fact that it is derived from
this document, and maintains a prominent reference in the
work to the original source.
b) The fact that the derived work is not the original OpenMath
document is stated prominently in the derived work. Moreover if
both this document and the derived work are Content Dictionaries
then the derived work must include a different CDName element,
chosen so that it cannot be confused with any works adopted by
the OpenMath Society. In particular, if there is a Content
Dictionary Group whose name is, for example, `math' containing
Content Dictionaries named `math1', `math2' etc., then you should
not name a derived Content Dictionary `mathN' where N is an integer.
However you are free to name it `private_mathN' or some such. This
is because the names `mathN' may be used by the OpenMath Society
for future extensions.
c) The derived work is distributed under terms that allow the
compilation of derived works, but keep paragraphs a) and b)
intact. The simplest way to do this is to distribute the derived
work under the OpenMath license, but this is not a requirement.
If you have questions about this license please contact the OpenMath
society at http://www.openmath.org.
Author: OpenMath Consortium SourceURL: https://github.com/OpenMath/CDs
Binary relations properties, equivalence relation, orders, up to the definition of a setoid as a set with an equivalence relations defined on its elements. Initial version: O. Caprotti
Type constructor; returns the type of binary relations on a set.
| [Next: reflexive] [Last: pre_order] [Top] |
Proposition; the type of reflexive binary relations.
| [Next: irreflexive] [Previous: relation] [Top] |
Proposition; the type of irreflexive binary relations.
| [Next: transitive] [Previous: reflexive] [Top] |
Proposition; the type of transitive binary relations.
| [Next: symmetric] [Previous: irreflexive] [Top] |
Proposition; the type of symmetric binary relations.
| [Next: antisymmetric] [Previous: transitive] [Top] |
Proposition; the type of antisymmetric binary relations.
| [Next: partial_equivalence] [Previous: symmetric] [Top] |
Proposition; the type of partial_equivalence relations, namely relations that are symmetric, and transitive.
| [Next: equivalence] [Previous: antisymmetric] [Top] |
Proposition; the type of equivalence relations, namely relations that are reflexive, symmetric and transitive.
| [Next: order] [Previous: partial_equivalence] [Top] |
Proposition; the type of order relations, namely relations that are reflexive, antisymmetric and transitive.
| [Next: strict_order] [Previous: equivalence] [Top] |
Proposition; the type of strict order relations, namely relations that are irreflexive, antisymmetric and transitive.
| [Next: pre_order] [Previous: order] [Top] |
Proposition; the type of preorder relations, namely relations that are reflexive and transitive.
| [First: relation] [Previous: strict_order] [Top] |