MathStructures
http://mathv.chapman.edu/~jipsen/structures/
2018-12-19T08:46:45-08:00MathStructures
http://mathv.chapman.edu/~jipsen/structures/
http://mathv.chapman.edu/~jipsen/structures/lib/images/favicon.icotext/html2018-11-07T15:27:24-08:00Peter Jipsenintegral_relation_algebras
http://mathv.chapman.edu/~jipsen/structures/doku.php/integral_relation_algebras?rev=1541633244&do=diff
Integral relation algebras
Abbreviation: IRA (this may also abbreviate the variety generated by all integral relation algebras)
Definition
An <b><i>integral relation algebra</i></b> is a relation algebra that is
<b><i>integral</i></b>:
Definition
An <b><i>integral relation algebra</i></b> is a relation algebra in which <b><i>the identity element is or an atom</i></b><b><i>Title</i></b><b>1</i></b>text/html2018-10-20T08:48:10-08:00Peter Jipsenmv-algebras
http://mathv.chapman.edu/~jipsen/structures/doku.php/mv-algebras?rev=1540050490&do=diff
MV-algebras
Abbreviation: MV
Definition
An <b><i>MV-algebra</i></b> (short for <b><i>multivalued logic algebra</i></b>) is a
structure such that
is a commutative monoid
Remark: This is the definition from
Morphisms
Let and be MV-algebras. A morphism from to is a function that is a homomorphism: <b><i>MV-algebra</i></b><b><i>MV-algebra</i></b><b><i>Wajsberg algebra</i></b><b><i>bounded Wajsberg hoop</i></b><b><i>lattice implication algebra</i></b><b><i>On the structure of ho…text/html2018-10-14T16:16:03-08:00Peter Jipsendistributive_lattice_ordered_semigroups
http://mathv.chapman.edu/~jipsen/structures/doku.php/distributive_lattice_ordered_semigroups?rev=1539558963&do=diff
Distributive lattice-ordered semigroups
Abbreviation: DLOS
Definition
A <b><i>distributive lattice ordered semigroup</i></b> is a structure of type such that
is a distributive lattice
is a semigroup
distributes over : and
Morphisms
Let and be distributive lattice-ordered semigroups. A morphism from to is a function that is a homomorphism:
,
,
<b><i>Representations of distributive lattice-ordered semigroups with binary relations</i></b><b>28</i></b>text/html2018-08-15T10:18:08-08:00Peter Jipsengeneralized_pseudo-effect_algebras
http://mathv.chapman.edu/~jipsen/structures/doku.php/generalized_pseudo-effect_algebras?rev=1534353488&do=diff
Generalized pseudo-effect algebras
Abbreviation: GPEAlg
Definition
A <b><i>generalized pseudo-effect algebra</i></b> is a generalized separation algebra that is
<b><i>postive</i></b>: implies .
Morphisms
Let and be generalized pseudo-effect algebra. A morphism from to is a function that is a homomorphism:
and
if then .text/html2018-08-15T10:14:42-08:00Peter Jipsengeneralized_effect_algebras - created
http://mathv.chapman.edu/~jipsen/structures/doku.php/generalized_effect_algebras?rev=1534353282&do=diff
Generalized effect algebras
Abbreviation: GEAlg
Definition
A <b><i>generalized effect algebra</i></b> is a separation algebra that is
<b><i>positive</i></b>: implies .
Definition
A <b><i>generalized effect algebra</i></b> is of the form where is a partial operation such that<b><i>commutative</i></b><b><i>associative</i></b><b><i>identity</i></b><b><i>cancellative</i></b><b><i>positive</i></b>text/html2018-08-11T14:23:26-08:00Peter Jipsencommutative_bck-algebras
http://mathv.chapman.edu/~jipsen/structures/doku.php/commutative_bck-algebras?rev=1534022606&do=diff
Commutative BCK-algebras
Abbreviation: ComBCK
Definition
A <b><i>commutative BCK-algebra</i></b> is a structure of type such that
(1):
(2):
(3):
(4):
(5):
Remark:
Note that the commutativity does not refer to the operation , but rather to the
term operation , which turns out to be a meet with respect
to the following partial order:<b><i>commutative BCK-algebra</i></b>text/html2018-08-11T14:15:04-08:00Peter Jipsenbck-algebras
http://mathv.chapman.edu/~jipsen/structures/doku.php/bck-algebras?rev=1534022104&do=diff
BCK-algebras
Abbreviation: BCK
Definition
A <b><i>BCK-algebra</i></b> is a structure of type such that
(1):
(2):
(3):
(4):
Remark:
is a partial order, with as least element.
BCK-algebras provide algebraic semantics for BCK-logic, named after
the combinators B, C, and K by C. A. Meredith, see .<b><i>BCK-algebra</i></b><b><i>Formal logic</i></b><b><i>BCK-algebras do not form a variety</i></b><b>28</i></b><b><i>Interpolation and amalgamation properties of BCK-algebras</i></b…text/html2018-08-04T22:44:58-08:00Peter Jipsenseparation_algebras - created
http://mathv.chapman.edu/~jipsen/structures/doku.php/separation_algebras?rev=1533447898&do=diff
Separation algebras
Abbreviation: SepAlg
Definition
A <b><i>separation algebra</i></b> is a generalized separation algebra such that
is <b><i>commutative</i></b>: .
I.e., a separation algebra is a cancellative commutative partial monoid.
Morphisms
Let and be cancellative partial monoids. A morphism from to is a function that is a homomorphism:
and
if then .text/html2018-08-04T18:48:34-08:00Peter Jipsengeneralized_separation_algebras - created
http://mathv.chapman.edu/~jipsen/structures/doku.php/generalized_separation_algebras?rev=1533433714&do=diff
Generalized separation algebras
Abbreviation: GSepAlg
Definition
A <b><i>generalized separation algebra</i></b> is a cancellative partial monoid such that
is <b><i>conjugative</i></b>: .
Morphisms
Let and be cancellative partial monoids. A morphism from to is a function that is a homomorphism:
and
if then .text/html2018-08-04T18:39:19-08:00Peter Jipsenconjugative_binars - created
http://mathv.chapman.edu/~jipsen/structures/doku.php/conjugative_binars?rev=1533433159&do=diff
Conjugative binars
Abbreviation: ConBin
Definition
A <b><i>conjugative binar</i></b> is a binar such that
is conjugative: .
Morphisms
Let and be commutative binars. A morphism from to is a function that is a homomorphism:
Examples
Example 1:text/html2018-08-04T18:29:41-08:00Peter Jipsenindex.html
http://mathv.chapman.edu/~jipsen/structures/doku.php/index.html?rev=1533432581&do=diff
Mathematical Structures
The webpages collected here list information about classes of
mathematical structures. The aim is to have a central place to check
what properties are known about these structures.
These pages are currently still under construction. Knowledgeable readers are encouraged to add or correct information.
To enable the edit button on each page, use the Login link (above) to log in or create an account.text/html2018-08-04T18:24:11-08:00Peter Jipsencancellative_partial_monoids - created
http://mathv.chapman.edu/~jipsen/structures/doku.php/cancellative_partial_monoids?rev=1533432251&do=diff
Cancellative partial monoids
Abbreviation: CanPMon
Definition
A <b><i>cancellative partial monoid</i></b> is a partial monoid such that
is <b><i>left-cancellative</i></b>: implies and
is <b><i>right-cancellative</i></b>: implies .
Morphisms
Let and be cancellative partial monoids. A morphism from to is a function that is a homomorphism:
and
if then .text/html2018-08-04T18:07:47-08:00Peter Jipsenpartial_groupoids
http://mathv.chapman.edu/~jipsen/structures/doku.php/partial_groupoids?rev=1533431267&do=diff
Partial groupoids
Abbreviation: Pargoid
Definition
A <b><i>partial groupoid</i></b> is a structure , where
is a <b><i>partial binary operation</i></b>, i.e., .
Remark: The domain of definition of is Dom
Morphisms
Let and be partial groupoids. A morphism from to is a function that is a homomorphism:
if then <b><i>The theory of partial algebraic operations</i></b>