On the public citation graph

The theory of idempotent semigroups is of unification type zero

https://doi.org/10.1007/bf02328451
0 signed · 40 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/bf02573590openalex-snapshot
A Noetherian and confluent rewrite system for 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.2140/pjm.1958.8.257openalex-snapshot
The structure of idempotent semigroups. I

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-44612-5_41openalex-snapshot
Matching Modulo Associativity and Idempotency Is NP—Complete
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_35openalex-snapshot
Unification 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-52885-7_118openalex-snapshot
Unification in monoidal theories
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/978-3-030-22102-7_26openalex-snapshot
A Note on Unification, Subsumption and Unification Type
inferred← citeshttps://doi.org/10.1007/978-3-032-21540-6_17openalex-snapshot
An Order-Theoretic View on Optimal Repairs and Complete Sets of Unifiers
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_11openalex-snapshot
What Is Essential Unification?
inferred← citeshttps://doi.org/10.1007/978-3-642-73005-4_25openalex-snapshot
Narrowing Techniques Applied to Idempotent Unification
inferred← citeshttps://doi.org/10.1007/bf00243791openalex-snapshot
Unification in Abelian semigroups
inferred← citeshttps://doi.org/10.1007/bf00245459openalex-snapshot
Hilbert's tenth problem is of unification type zero
inferred← citeshttps://doi.org/10.1007/bf00249020openalex-snapshot
The unification hierarchy is undecidable
inferred← citeshttps://doi.org/10.1007/bf00881887openalex-snapshot
Unification in partially commutative semigroups
inferred← citeshttps://doi.org/10.1007/bf02575010openalex-snapshot
Unification in varieties of idempotent semigroups
inferred← citeshttps://doi.org/10.1007/bf02733227openalex-snapshot
Unification problem in equational theories
inferred← citeshttps://doi.org/10.1007/bfb0012844openalex-snapshot
Unification in finite algebras is unitary(?)
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90098-1openalex-snapshot
A note on unification type zero
inferred← citeshttps://doi.org/10.1016/0167-9236(90)90027-oopenalex-snapshot
Unification theory
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90140-5openalex-snapshot
Unification in commutative idempotent monoids
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50010-2openalex-snapshot
Unification Theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.07.004openalex-snapshot
A Formalisation of Nominal C-Matching through Unification with Protected Variables
inferred← citeshttps://doi.org/10.1016/j.jal.2004.12.001openalex-snapshot
Essential unifiers
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.020openalex-snapshot
Anti-unification and the theory of semirings
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80021-5openalex-snapshot
On equational theories, unification, and (Un)decidability
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80022-7openalex-snapshot
Unification in a combination of arbitrary disjoint equational theories
inferred← citeshttps://doi.org/10.1017/s0960129521000050openalex-snapshot
Formalising nominal C-unification generalised with protected variables
inferred← citeshttps://doi.org/10.1093/jigpal/jzq008openalex-snapshot
Unification in modal and description logics
inferred← citeshttps://doi.org/10.1109/icse.1988.93714openalex-snapshot
Algebraic specification of Macintosh's QuickDraw using OBJ2
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.1145/179812.179813openalex-snapshot
On solving equations and disequations
inferred← citeshttps://doi.org/10.1145/3359060openalex-snapshot
Idempotent Anti-unification
inferred← citeshttps://doi.org/10.1145/62029.62030openalex-snapshot
Unification: a multidisciplinary survey
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:23)2015openalex-snapshot
Exact Unification and Admissibility
inferred← citeshttps://doi.org/10.5555/55823.55856openalex-snapshot
Algebraic specification of Macintosh's Quickdraw using OBJ2
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.