Completely dissociative groupoids.

DOI10.21136/MB.2012.142789zbMATH Open1249.20075arXiv1111.4665MaRDI QIDQ2897340FDOQ2897340

Authors: Milton Braitt, David Hobby, Donald Silberger 

Publication date: 10 July 2012

Published in: Mathematica Bohemica (Search for Journal in Brave)

Abstract: Consider arbitrarily parenthesized expressions on the $k$ variables $x_0,x_1,\mathrm{...},x_{k-1}$, where each $x_i$ appears exactly once and in the order of their indices. We call these expressions {em formal $k$--products}. $F^{s}igma(k)$ denotes the set of formal $k$--products. For $$, the claim, that $$ and $$ produce equal elements in a groupoid $G$ for all values assumed in $G$ by the variables $x_i$, attributes to $G$ a {em generalized associative law}. Many groupoids are {em completely dissociative}; i.e., no generalized associative law holds for them; two examples are the groupoids on $0,1$ whose binary operations are implication and NAND. We prove a variety of results of that flavor.

Full work available at URL: https://arxiv.org/abs/1111.4665

Recommendations

• Antiassociative groupoids.
• Publication:4374836
• scientific article; zbMATH DE number 5127301
• Publication:4374835
• Varieties of groupoids determined by short linear identities

zbMATH Keywords

reverse Polish notationdissociative groupoidsformal productsgeneralized associative groupoids

Mathematics Subject Classification ID

Relational systems, laws of composition (08A02) Sets with a single binary operation (groupoids) (20N02)

Cited In (2)

• Antiassociative groupoids.
• Associative spectra of graph algebras. I: Foundations, undirected graphs, antiassociative graphs

This page was built for publication: Completely dissociative groupoids.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2897340)