On the public citation graph

Completely simple and completely O-simple semigroup identities

https://doi.org/10.1007/bf02573138
0 signed · 17 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/bf02194654openalex-snapshot
Completely O-simple semigroups and their associated graphs and groups
inferredcites →https://doi.org/10.1007/bf02572269openalex-snapshot
The lattice of semigroup varieties
inferredcites →https://doi.org/10.1007/bf02573438openalex-snapshot
On bases of completely simple semigroups identities
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0716841-1openalex-snapshot
All Varieties of Central Completely Simple Semigroups
inferredcites →https://doi.org/10.1112/blms/14.2.119openalex-snapshot
The Laws of Finite Pointed Groups
inferredcites →https://doi.org/10.2140/pjm.1983.104.351openalex-snapshot
Word problems for free objects in certain varieties of completely regular semigroups

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf02573687openalex-snapshot
Identities of a five-element 0-simple semigroup
inferred← citeshttps://doi.org/10.1007/s00012-008-2116-7openalex-snapshot
The pn sequences of semigroup varieties generated by combinatorial 0-simple semigroups
inferred← citeshttps://doi.org/10.1007/s00233-005-0510-4openalex-snapshot
Computational Complexity of Checking Identities in 0-Simple Semigroups and Matrix Semigroups over Finite Fields
inferred← citeshttps://doi.org/10.1007/s00233-006-0615-4openalex-snapshot
Free Spectrum of the Variety Generated by the Five Element Combinatorial Brandt Semigroup
inferred← citeshttps://doi.org/10.1007/s00233-025-10544-zopenalex-snapshot
A counter-example in the theory of E-solid completely 0-simple semigroups
inferred← citeshttps://doi.org/10.1007/s002339900044openalex-snapshot
On the finite basis problem for completely 0-simple semigroup identities
inferred← citeshttps://doi.org/10.1017/s0017089507003448openalex-snapshot
ON THE FREE SPECTRUM OF THE VARIETY GENERATED BY THE COMBINATORIAL COMPLETELY 0-SIMPLE SEMIGROUPS
inferred← citeshttps://doi.org/10.1023/a:1021695118634openalex-snapshot
Unification Types of Completely Regular Semigroups
inferred← citeshttps://doi.org/10.1080/00927879908826762openalex-snapshot
Identities of locally testable semigroups
inferred← citeshttps://doi.org/10.1142/s0218196707004232openalex-snapshot
A NEW METHOD IN THE FINITE BASIS PROBLEM WITH APPLICATIONS TO RANK 2 TRANSFORMATION SEMIGROUPS
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2337openalex-snapshot
On identities of indicator burnside 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.