On the public citation graph

Unification in varieties of idempotent semigroups

https://doi.org/10.1007/bf02575010
0 signed · 37 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/mana.19710480118openalex-snapshot
All Varieties of Bands I
inferredcites →https://doi.org/10.1002/mana.19710480119openalex-snapshot
A Construction and a Classification of Bands
inferredcites →https://doi.org/10.1007/3-540-12727-5_12openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferredcites →https://doi.org/10.1007/3-540-12727-5_16openalex-snapshot
Confluent and coherent equational term rewriting systems application to proofs in abstract data types
inferredcites →https://doi.org/10.1007/3-540-16780-3_112openalex-snapshot
Unification in the data structure sets
inferredcites →https://doi.org/10.1007/3-540-16780-3_115openalex-snapshot
Unification in boolean rings
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferredcites →https://doi.org/10.1007/bf02218673openalex-snapshot
Varieties of idempotent semigroups
inferredcites →https://doi.org/10.1007/bf02328450openalex-snapshot
Unification under associativity and idempotence is of type nullary
inferredcites →https://doi.org/10.1007/bf02328451openalex-snapshot
The theory of idempotent semigroups is of unification type zero
inferredcites →https://doi.org/10.1007/bf02572269openalex-snapshot
The lattice of semigroup varieties
inferredcites →https://doi.org/10.1007/bf02573192openalex-snapshot
The lattices of varieties and pseudovarieties of band monoids
inferredcites →https://doi.org/10.1007/bf02573590openalex-snapshot
A Noetherian and confluent rewrite system for idempotent semigroups
inferredcites →https://doi.org/10.1016/0021-8693(70)90073-6openalex-snapshot
The lattice of equational classes of idempotent semigroups
inferredcites →https://doi.org/10.1016/0304-3975(86)90175-1openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.2140/pjm.1958.8.257openalex-snapshot
The structure of idempotent semigroups. I
inferredcites →https://doi.org/10.2307/2307797openalex-snapshot
Idempotent Semigroups

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jabr.1997.7212openalex-snapshot
Unification in Commutative Semigroups
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_41openalex-snapshot
Matching Modulo Associativity and Idempotency Is NP—Complete
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_96openalex-snapshot
Characterizations of unification type zero
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_5openalex-snapshot
Unification theory
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_9openalex-snapshot
Unification in varieties of completely regular semigroups
inferred← citeshttps://doi.org/10.1007/bf00245459openalex-snapshot
Hilbert's tenth problem is of unification type zero
inferred← citeshttps://doi.org/10.1007/bf00245463openalex-snapshot
Complexity of unification problems with associative-commutative operators
inferred← citeshttps://doi.org/10.1007/bfb0018357openalex-snapshot
Unification properties of commutative theories: A categorical treatment
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90098-1openalex-snapshot
A note on unification type zero
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90140-5openalex-snapshot
Unification in commutative idempotent monoids
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80055-0openalex-snapshot
Unification in commutative theories
inferred← citeshttps://doi.org/10.1023/a:1021695118634openalex-snapshot
Unification Types of Completely Regular Semigroups
inferred← citeshttps://doi.org/10.1145/174130.174133openalex-snapshot
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
inferred← citeshttps://doi.org/10.2307/2274856openalex-snapshot
The undecidability of the DA-unification problem
inferred← citeshttps://doi.org/10.7146/brics.v7i13.20140openalex-snapshot
Matching Modulo Associativity and Idempotency is NP-Complete
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.