On the public citation graph

Algorithmic problems in varieties of semigroups

https://doi.org/10.1007/bf01978400

0 signed · 23 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.1002/zamm.19650450526openalex-snapshot

L. Rédei, Theorie der endlich erzeugbaren kommutativen Halbgruppen. (Hamburger Mathematische Einzelschriften, 41. Heft) 228 S. Würzburg 1963. Physica‐Verlag. Preis geb. DM 35,—

inferredcites →https://doi.org/10.1007/978-3-642-88599-0openalex-snapshot

Varieties of Groups

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

The problem of equality in varieties of semigroups, rings, and lie algebras

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

Unsolvability of the universal theory of finite groups

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

Unsolvability of problems of equality and divisibility in certain varieties of semigroups

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

Model-theoretic and algorithmic questions in group theory

inferredcites →https://doi.org/10.1016/0021-8693(69)90058-1openalex-snapshot

Bases for equational theories of semigroups

inferredcites →https://doi.org/10.1016/s0049-237x(08)70531-7openalex-snapshot

Equational Logic and Equational Theories of Algebras

inferredcites →https://doi.org/10.1070/sm1969v009n04abeh001131openalex-snapshot

CHARACTERIZATION OF THE CATEGORY OF POLYGONS

inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot

SEMIGROUPS AND COMBINATORIAL APPLICATIONS

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-23534-9_17openalex-snapshot

Minsky Machines and Algorithmic Problems

inferred← citeshttps://doi.org/10.1007/978-94-011-0149-3_6openalex-snapshot

Algorithmic Problems in Groups, Semigroups and Inverse Semigroups

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

Unsolvable algorithmic problems for semigroups, groups, and rings

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

On cross semigroup varieties and related questions

inferred← citeshttps://doi.org/10.1007/s13373-017-0103-zopenalex-snapshot

Algorithmically complex residually finite groups

inferred← citeshttps://doi.org/10.1023/a:1021125502991openalex-snapshot

On Complexity of the Word Problem for Finitely Presented Commutative Semigroups

inferred← citeshttps://doi.org/10.1070/im1988v030n02abeh001012openalex-snapshot

PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS

inferred← citeshttps://doi.org/10.1070/sm1988v061n01abeh003199openalex-snapshot

INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS

inferred← citeshttps://doi.org/10.1070/sm1990v067n02abeh002097openalex-snapshot

THE WORD PROBLEM FOR SOLVABLE LIE ALGEBRAS AND GROUPS

inferred← citeshttps://doi.org/10.1070/sm1991v068n02abeh001201openalex-snapshot

A MINIMAL VARIETY OF ASSOCIATIVE ALGEBRAS WITH UNSOLVABLE WORD PROBLEM

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

Undecidability of the identity problem for finite semigroups

inferred← citeshttps://doi.org/10.32603/2071-2340-2025-4-15-26openalex-snapshot

Точное матричное представление полурешетки полугрупп правых нулей с бесконечным рангом преобразований

inferred← citeshttps://doi.org/10.48550/arxiv.1504.07736openalex-snapshot

Minsky machines and algorithmic problems

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.