We investigate the factor of the groupoid of terms through the largest congruence with a given set among its blocks. The set is supposed to be closed for overterms.

The left distributive law is the law a· (b· c) = (a·b) · (a· c). Left distributive algebras have been classically used in the study of knots and braids, and more recently free left distributive algebras have been studied in connection with large cardinal axioms in set theory. We provide a survey of results on the free left distributive algebra on one generator, A, and a new, simplified proof of the existence of a normal form for terms in A. Topics included are: the confluence of A, the linearity...

The main result of this paper is a description of totally commutative idempotent groupoids. In particular, we show that if an idempotent groupoid (G,·) has precisely m ≥ 2 distinct essentially binary polynomials and they are all commutative, then G contains a subgroupoid isomorphic to the groupoid $N_m$ described below. In [2], this fact was proved for m = 2.

To everz partiallz ordered set a certain groupoid is assigned. A tolerance on it is defined similarlz as a congruence, onlz the requirement of transitivitz is omitted. Some theorems concerning these tolerances are proved.

In this paper, by a travel groupoid is meant an ordered pair $(V,*)$ such that $V$ is a nonempty set and $*$ is a binary operation on $V$ satisfying the following two conditions for all $u,v\in V$: $$(u*v)*u=u;\text{if}(u*v)*v=u,\text{then}u=v.$$ Let $(V,*)$ be a travel groupoid. It is easy to show that if $x,y\in V$, then $x*y=y$ if and only if $y*x=x$. We say that $(V,*)$ is on a (finite or infinite) graph $G$ if $V\left(G\right)=V$ and $$E\left(G\right)=\left\{\right\{u,v\}u,v\in V\text{and}u\ne u*v=v\}.$$ Clearly, every travel groupoid is on exactly one graph. In this paper, some properties of travel groupoids on graphs are studied.

The notion of travel groupoids was introduced by L. Nebeský in 2006 in connection with a study on geodetic graphs. A travel groupoid is a pair of a set $V$ and a binary operation $*$ on $V$ satisfying two axioms. We can associate a graph with a travel groupoid. We say that a graph $G$ has a travel groupoid if the graph associated with the travel groupoid is equal to $G$. Nebeský gave a characterization of finite graphs having a travel groupoid. In this paper, we study travel groupoids on infinite graphs....

A characterization of all classes of idempotent groupoids having no more than two essentially binary term operations with respect to small finite models is given.