| Home | Overview | Documents | Content Dictionaries | Software & Tools | The OpenMath Society | OpenMath Projects | OpenMath Discussion Lists | OpenMath Meetings | Links |
A CD of basic algebraic category constructors. This CD holds constructors of individual instances of the categories, with defining properties of the categories and accessor symbols to allow access to attributes of the categories.
This is the constructor for monoids. A monoid comprises a set and an operation over elements of the set. The set must contain a unique identity element (relative to the operation). That is an element, I, such that I*a=a*I=a where a represents an arbitrary element of S and * represents the operation. The operation * must be associative over S. The monoid constructor takes three arguments, the set of the monoid, a binary function taking two elements of the set into itself to represent the operation of the monoid and an element of the set to represent the identity of the monoid.
| [Next: monoid_set] [Last: integral_domain_negative] [Top] |
This symbol takes one argument which should be a monoid, it returns the set of the monoid.
| [Next: monoid_operation] [Previous: monoid] [Top] |
This symbol takes one argument which should be a monoid, it returns the operation of the monoid.
| [Next: monoid_identity] [Previous: monoid_set] [Top] |
This symbol takes one argument which should be a monoid, it returns the identity of the monoid.
| [Next: Abelian_monoid] [Previous: monoid_operation] [Top] |
This is the constructor for Abelian monoids. An Abelian monoid is a monoid, such that the operation is commutative between members of the Abelian monoid. The Abelian_monoid constructor takes three arguments, the set of the Abelian monoid, a binary function taking two elements of the set into itself to represent the operation of the Abelian monoid and an element of the set to represent the identity of the Abelian monoid.
| [Next: Abelian_monoid_set] [Previous: monoid_identity] [Top] |
This symbol takes one argument which should be an Abelian monoid, it returns the set of the Abelian monoid.
| [Next: Abelian_monoid_operation] [Previous: Abelian_monoid] [Top] |
This symbol takes one argument which should be an Abelian monoid, it returns the operation of the Abelian monoid.
| [Next: Abelian_monoid_identity] [Previous: Abelian_monoid_set] [Top] |
This symbol takes one argument which should be an Abelian monoid, it returns the identity of the Abelian monoid.
| [Next: ordered_monoid] [Previous: Abelian_monoid_operation] [Top] |
This is the constructor for ordered monoids, that is monoids on which there is an ordering relation. The ordered_monoid constructor takes four arguments, the set of the ordered monoid, a binary function taking two elements of the set into itself to represent the operation of the ordered monoid, an element of the set to represent the identity of the ordered monoid and a binary function taking two elements of the set into the booleans to represent the ordering on the ordered monoid.
| [Next: ordered_monoid_set] [Previous: Abelian_monoid_identity] [Top] |
This symbol takes one argument which should be an ordered monoid. It returns a set which should be the set of the ordered monoid.
| [Next: ordered_monoid_operation] [Previous: ordered_monoid] [Top] |
This symbol takes one argument which should be an ordered monoid. It returns a binary function between elements of the set of the ordered monoid, which should represent the operation of the ordered monoid.
| [Next: ordered_monoid_identity] [Previous: ordered_monoid_set] [Top] |
This symbol takes one argument which should be an ordered monoid. It returns an element of the set of the ordered monoid, which should be the identity of the ordered monoid.
| [Next: ordered_monoid_order] [Previous: ordered_monoid_operation] [Top] |
This symbol takes one argument which should be an ordered monoid. It returns a binary function between elements of the set of the ordered monoid, which should represent the ordering relation on the ordered monoid.
| [Next: ordered_Abelian_monoid] [Previous: ordered_monoid_identity] [Top] |
This symbol is the constructor for ordered Abelian monoids, that is Abelian monoids on which there is an ordering relation. The ordered_Abelian_monoid constructor takes four arguments, the set of the ordered Abelian monoid, a binary function taking two elements of the set into itself to represent the operation of the ordered Abelian monoid, an element of the set to represent the identity of the ordered Abelian monoid and a binary function taking two elements of the set into the booleans to represent the ordering of the ordered Abelian monoid.
| [Next: ordered_Abelian_monoid_set] [Previous: ordered_monoid_order] [Top] |
This symbol takes one argument which should be an ordered Abelian monoid. It returns a set which should be the set of the ordered Abelian monoid.
| [Next: ordered_Abelian_monoid_operation] [Previous: ordered_Abelian_monoid] [Top] |
This symbol takes one argument which should be an ordered Abelian monoid. It returns a binary function between elements of the set of the ordered Abelian monoid, which should represent the operation of the ordered Abelian monoid.
| [Next: ordered_Abelian_monoid_identity] [Previous: ordered_Abelian_monoid_set] [Top] |
This symbol takes one argument which should be an ordered Abelian monoid. It returns an element of the set of the ordered Abelian monoid, which should be the identity of the ordered Abelian monoid.
| [Next: ordered_Abelian_monoid_order] [Previous: ordered_Abelian_monoid_operation] [Top] |
This symbol takes one argument which should be an ordered Abelian monoid. It returns a binary function between elements of the set of the ordered Abelian monoid, which should represent the ordering relation on the ordered Abelian monoid.
| [Next: groupoid] [Previous: ordered_Abelian_monoid_identity] [Top] |
This symbol is the constructor for groupoids, that is an algebraic structure on a set, with a binary operation. The operator of the groupoid must be closed over the set of the groupoid. The groupoid constructor takes two arguments, the set of the groupoid and a binary function which represents the operation of the groupoid.
| [Next: groupoid_set] [Previous: ordered_Abelian_monoid_order] [Top] |
This symbol takes one argument which should be a groupoid. It returns the set of the groupoid.
| [Next: groupoid_operation] [Previous: groupoid] [Top] |
This symbol takes one argument which should be a groupoid. It returns a binary function which should represent the operation of the groupoid.
| [Next: semigroup] [Previous: groupoid_set] [Top] |
This symbol is the constructor for semigroups, that is groupoids for which the operator of the semigroup is associative over the set of the semigroup. The semigroup constructor takes two arguments, the set of the semigroup and a binary function which represents the operation of the semigroup.
| [Next: semigroup_set] [Previous: groupoid_operation] [Top] |
This symbol takes one argument which should be a semigroup. It returns the set of the semigroup.
| [Next: semigroup_operation] [Previous: semigroup] [Top] |
This symbol takes one argument which should be a semigroup. It returns a binary function which should represent the operation of the semigroup.
| [Next: Abelian_semigroup] [Previous: semigroup_set] [Top] |
This symbol is the constructor for an Abelian semigroup, that is a semigroup which has an operator which is commutative over the set of the semigroup. The Abelian semigroup constructor takes two arguments, the set of the Abelian semigroup and a binary function which represents the operation of the Abelian semigroup.
| [Next: Abelian_semigroup_set] [Previous: semigroup_operation] [Top] |
This symbol takes one argument which should be an Abelian semigroup. It returns a set, which should be the set of the Abelian semigroup.
| [Next: Abelian_semigroup_operation] [Previous: Abelian_semigroup] [Top] |
This symbol takes one argument which should be an Abelian semigroup. It returns a binary function, which should represent the operation of the Abelian semigroup.
| [Next: group] [Previous: Abelian_semigroup_set] [Top] |
This symbol is an alternative model for the symbol declare_group in the CD group1
This symbol is the constructor for groups, that is a monoid for which every element is invertible. The group constructor takes four arguments, the set of the group, a binary function taking two elements of the set into itself to represent the operation of the group, an element of the set to represent the identity of the group and a unary function taking the set into itself to specify inverse elements of the group.
| [Next: group_set] [Previous: Abelian_semigroup_operation] [Top] |
This symbol takes one argument which should be a group. It returns a set, which should be the set of the group.
| [Next: group_operation] [Previous: group] [Top] |
This symbol takes one argument which should be a group. It returns a binary function, which represents the operation of the group.
| [Next: group_identity] [Previous: group_set] [Top] |
This symbol takes one argument which should be a group. It returns the identity of the group.
| [Next: group_inverse] [Previous: group_operation] [Top] |
This symbol takes one argument which should be a group. It returns a unary function, which is the inverse mapping for the group.
| [Next: ordered_group] [Previous: group_identity] [Top] |
This symbol is the constructor for ordered groups, that is a group on which there is an ordering relation. The ordered_group constructor takes five arguments, the set of the ordered group, a binary function taking two elements of the set into itself to represent the operation of the ordered group, an element of the set to represent the identity of the ordered group, a unary function taking the set into itself to specify inverse elements of the ordered group and a binary function taking two elements of the set into the booleans to specify the ordering of the ordered group.
| [Next: ordered_group_set] [Previous: group_inverse] [Top] |
This symbol takes one argument which should be an ordered group. It returns the set of the ordered group.
| [Next: ordered_group_operation] [Previous: ordered_group] [Top] |
This symbol takes one argument which should be an ordered group. It returns a binary function, which represents the operation of the ordered group.
| [Next: ordered_group_identity] [Previous: ordered_group_set] [Top] |
This symbol takes one argument which should be an ordered group. It returns the identity of the ordered group.
| [Next: ordered_group_inverse] [Previous: ordered_group_operation] [Top] |
This symbol takes one argument which should be an ordered group. It returns a unary function, which is the inverse function of the ordered group.
| [Next: ordered_group_order] [Previous: ordered_group_identity] [Top] |
This symbol takes one argument which should be an ordered group. It returns a binary function, which represents the ordering of the ordered group.
| [Next: Abelian_group] [Previous: ordered_group_inverse] [Top] |
This symbol is the constructor for Abelian groups, that is a group such that the operation is commutative between members of the group. The Abelian_group constructor takes four arguments, the set of the Abelian group, a binary function taking two elements of the set into itself to represent the operation of the Abelian group, an element of the set to represent the identity of the Abelian group and a unary function taking the set into itself to specify inverse elements.
| [Next: Abelian_group_set] [Previous: ordered_group_order] [Top] |
This symbol takes one argument which should be an Abelian group. It returns the set of the Abelian group.
| [Next: Abelian_group_operation] [Previous: Abelian_group] [Top] |
This symbol takes one argument which should be an Abelian group. It returns a binary function, which represents the operation of the Abelian group.
| [Next: Abelian_group_identity] [Previous: Abelian_group_set] [Top] |
This symbol takes one argument which should be an Abelian group. It returns the identity of the Abelian group.
| [Next: Abelian_group_inverse] [Previous: Abelian_group_operation] [Top] |
This symbol takes one argument which should be an Abelian group. It reurns a unary function, which should be the inverse function for the Abelian group.
| [Next: ordered_Abelian_group] [Previous: Abelian_group_identity] [Top] |
This symbol is the constructor for ordered Abelian groups, that is an Abelian group on which there is an ordering relation. The ordered_Abelian_group constructor takes five arguments, the set of the ordered Abelian group, a binary function taking two elements of the set into itself to represent the operation of the ordered Abelian group, an element of the set to represent the identity of the ordered Abelian group, a unary function taking the set into itself to specify inverse elements and a binary function taking two elements of the set into the booleans to specify the ordering of the ordered Abelian group.
| [Next: ordered_Abelian_group_set] [Previous: Abelian_group_inverse] [Top] |
This symbol takes one argument which should be an ordered Abelian group. It returns the set of the ordered Abelian group.
| [Next: ordered_Abelian_group_operation] [Previous: ordered_Abelian_group] [Top] |
This symbol takes one argument which should be an ordered Abelian group. It returns a binary function, which represents the operation of the ordered Abelian group.
| [Next: ordered_Abelian_group_identity] [Previous: ordered_Abelian_group_set] [Top] |
This symbol takes one argument which should be an ordered Abelian group. It returns the identity of the ordered Abelian group.
| [Next: ordered_Abelian_group_inverse] [Previous: ordered_Abelian_group_operation] [Top] |
This symbol takes one argument which should be an ordered Abelian group. It returns a unary function, which is the inverse function of the ordered Abelian group.
| [Next: ordered_Abelian_group_order] [Previous: ordered_Abelian_group_identity] [Top] |
This symbol takes one argument which should be an ordered Abelian group. It returns a binary function, which should represent the ordering of the ordered Abelian group.