On the public citation graph

Nonfinitely based three-element idempotent groupoids

https://doi.org/10.1007/bf01195139

0 signed · 13 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf02483103openalex-snapshot

A four-element algebra whose identities are not finitely based

inferredcites →https://doi.org/10.1007/bfb0063439openalex-snapshot

Inherently nonfinitely based finite algebras

inferredcites →https://doi.org/10.1090/s0002-9939-1954-0060482-6openalex-snapshot

Identities in Finite Algebras

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-51081-8_112openalex-snapshot

An equational logic sampler

inferred← citeshttps://doi.org/10.1007/bf01182458openalex-snapshot

Lyndon's groupoid isnot inherently nonfinitely based

inferred← citeshttps://doi.org/10.1007/bf01204782openalex-snapshot

Finite axiomatizability of congruence rich varieties

inferred← citeshttps://doi.org/10.1007/bf01229959openalex-snapshot

Every idempotent plain algebra generates a minimal variety

inferred← citeshttps://doi.org/10.1016/0747-7171(92)90013-topenalex-snapshot

A field guide to equational logic

inferred← citeshttps://doi.org/10.1016/j.jalgebra.2023.05.014openalex-snapshot

Algebras from finite group actions and a question of Eilenberg and Schützenberger

inferred← citeshttps://doi.org/10.1017/s0004972719001035openalex-snapshot

THE FINITE BASIS PROBLEM FOR INVOLUTION SEMIGROUPS OF TRIANGULAR MATRICES

inferred← citeshttps://doi.org/10.1112/s1461157014000412openalex-snapshot

Finite basis problem for semigroups of order six

inferred← citeshttps://doi.org/10.2307/2274762openalex-snapshot

Finite axiomatizability for equational theories of computable groupoids

inferred← citeshttps://doi.org/10.3934/era.2017.24.002openalex-snapshot

Equational theories of unstable involution semigroups

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.