Partial groupoid

Short description: Set endowed with a partial binary operation

Group-like structures
	Totality	Associativity	Identity	Invertibility	Commutativity
Semigroupoid	Unneeded	Required	Unneeded	Unneeded	Unneeded
Small Category	Unneeded	Required	Required	Unneeded	Unneeded
Groupoid	Unneeded	Required	Required	Required	Unneeded
Magma	Required	Unneeded	Unneeded	Unneeded	Unneeded
Quasigroup	Required	Unneeded	Unneeded	Required	Unneeded
Loop	Required	Unneeded	Required	Required	Unneeded
Semigroup	Required	Required	Unneeded	Unneeded	Unneeded
Inverse Semigroup	Required	Required	Unneeded	Required	Unneeded
Monoid	Required	Required	Required	Unneeded	Unneeded
Group	Required	Required	Required	Required	Unneeded
Abelian group	Required	Required	Required	Required	Required
^α Closure, which is used in many sources, is an equivalent axiom to totality, though defined differently.

In abstract algebra, a partial groupoid (also called halfgroupoid, pargoid, or partial magma) is a set endowed with a partial binary operation.

A partial groupoid is a partial algebra.

Partial semigroup

A partial groupoid $(G,\circ )$ is called a partial semigroup if the following associative law holds:

For all $x,y,z\in G$ such that $x\circ y\in G$ and $y\circ z\in G$, the following two statements hold:

1. $x\circ (y\circ z)\in G$ if and only if $(x\circ y)\circ z\in G$, and
2. $x\circ (y\circ z)=(x\circ y)\circ z$ if $x\circ (y\circ z)\in G$ (and, because of 1., also $(x\circ y)\circ z\in G$).

Further reading

• E.S. Ljapin; A.E. Evseev (1997). The Theory of Partial Algebraic Operations. Springer Netherlands. ISBN 978-0-7923-4609-8.